给定一个链表,两两交换其中相邻的节点,并返回交换后的链表。
你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
示例:
给定 1->2->3->4, 你应该返回 2->1->4->3.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode swapPairs(ListNode head) {
if(head == null){
return null;
}
ListNode dummyNode = new ListNode(0);
dummyNode.next = head;
ListNode cursor = dummyNode;
ListNode first = head;
ListNode second = head.next;
while (first != null && second != null){
first.next = second.next;
second.next = first;
cursor.next = second;
cursor = first;
if(first.next==null) break;
first = cursor.next;
second = first.next;
}
return dummyNode.next;
}
}