标签：
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.
题解：就把每两个节点的值换一下就ok了。
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* swapPairs(ListNode* head) { ListNode* p=head; while(p&&p->next){ int t=p->val; p->val=p->next->val; p->next->val=t; p=p->next->next; } return head; } };
leetcode 24. Swap Nodes in Pairs(链表)
标签：
原文地址：http://www.cnblogs.com/zywscq/p/5448705.html
