原题网址:https://leetcode.com/problems/swap-nodes-in-pairs/
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.
方法:注意保存next
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode swapPairs(ListNode head) {
if (head == null || head.next == null) return head;
ListNode current = head;
head = head.next;
current.next = head.next;
head.next = current;
while (current.next != null && current.next.next != null) {
ListNode next = current.next;
ListNode next2 = current.next.next;
current.next = next2;
next.next = next2.next;
next2.next = next;
current = next;
}
return head;
}
}