http://oj.leetcode.com/problems/swap-nodes-in-pairs/ 交换相邻的节点,思路如下所示: /** * 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 * root = new ListNode(-1); root->next = head; ListNode *head1 = root; ListNode *head2 = root; while(1) { if(head2->next == NULL || head2->next->next == NULL) break; head2 = head2->next->next; //begin swap head1->next->next = head2->next; head2->next = head1->next; head1->next = head2; //end swap head2 = head2->next; head1 = head2; } return root->next; } };