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.
一刷ac
解题思路:根据要求进行链表两两换位,只需要设置两个指针,进行指针操作。
/**
* 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) return head;
ListNode dummy = new ListNode(0);
ListNode node = dummy;
dummy.next = head;
ListNode first = head;
ListNode last = head.next;
while(last != null){
node.next = last;
node = node.next;
ListNode tmp = last.next;
last.next = first;
first.next = tmp;
node = node.next;
first = tmp;
if(first != null) last = first.next;
else last = first;
}
return dummy.next;
}
}