https://leetcode-cn.com/problems/swap-nodes-in-pairs/
思路如下图: 蓝绿色箭头代表我们要构建的指向,红色箭头代表原来的指向。
代码如下:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode swapPairs(ListNode head) {
ListNode dump = new ListNode(-1, head);
ListNode cur = dump;
while (cur.next != null && cur.next.next != null) {
ListNode tmp1 = cur.next;
ListNode tmp2 = cur.next.next.next;
cur.next = cur.next.next; //把第二个节点赋值给cur.next
cur.next.next = tmp1; //把第一个节点赋值给第二个节点的next指针
cur.next.next.next =tmp2; //把第三个节点的值赋值给第一个节点的next指针
cur = cur.next.next;
}
return dump.next;
}
}
递归解法:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
/*递归解法 */
public ListNode swapPairs(ListNode head) {
if (head == null || head.next == null) {
return head;
}
ListNode next = head.next;
//直到递归到最后的节点
ListNode new_node = swapPairs(next.next);
//操作
next.next = head;
head.next = new_node;
return next;
}
}