leetcode 518，[leetcode] 24. Swap Nodes in Pairs

2023-10-17 阅读 29 评论 0

摘要：題目 Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may not modify the values in the lis

題目

Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
Subscribe to see which companies asked this question

描述

讀題只能改鏈表節點里的值，那么這題不是很簡單嗎？直接交換就可以了

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     struct ListNode *next;* };*/
struct ListNode* swapPairs(struct ListNode* head) {struct ListNode *p, *pnext;int tmp;p = head;while(p && p->next){tmp = p->val;p->val = p->next->val;p->next->val = tmp;p = p->next->next;}return head;
}

Accept，不知道這道題想考察什么~~

原文链接：https://hbdhgg.com/4/143578.html

上一篇：字符串匹配是什么意思，kmp算法字符串匹配C語言實現

下一篇：一個動態增長的棧實現