【LeetCode OJ】Swap Nodes in Pairs
2015-04-02 09:20
405 查看
题目:Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
代码:
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.
代码:
struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; ListNode *swapPairs(ListNode *head) { if (head == NULL || head->next == NULL) return head; ListNode *p = head; ListNode *q = p->next; while (q) { int temp; temp = p->val; p->val = q->val; q->val = temp; if (q->next != NULL) { p = q->next; if (p->next != NULL) q = p->next; else break; } else break; } return head; }
相关文章推荐
- [LeetCode OJ]Swap Nodes in Pairs
- Leetcode OJ 24 Swap Nodes in Pairs [Medium]
- LeetCode OJ:Swap Nodes in Pairs
- LeetCode OJ--Swap Nodes in Pairs
- LeetCode OJ:Swap Nodes in Pairs(成对交换节点)
- LeetCode OJ - Swap Nodes in Pairs
- [LeetCode OJ]Swap Nodes in Pairs
- LeetCode OJ 之 Swap Nodes in Pairs (交换成对相邻结点的值)
- 【LeetCode OJ】Swap Nodes in Pairs
- Leetcode 24 Swap Nodes in Pairs
- LeetCode | 24. Swap Nodes in Pairs
- LeetCode 23. Swap Nodes in Pairs
- LeetCode Online Judge 题目C# 练习 - Swap Nodes in Pairs
- leetcode——Swap Nodes in Pairs
- LeetCode--Swap Nodes in Pairs
- leetcode之24. Swap Nodes in Pairs(C++实现&链表实现和整体测试)
- LeetCode Swap Nodes in Pairs
- 【LeetCode】Swap Nodes in Pairs
- LeetCode (Swap Nodes in Pairs)
- Swap Nodes in Pairs