题目
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.
思路
设置两个结点指向p和q,两个同时移动完成交换结点,问题解决
代码
/**
* 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 r = new ListNode(0);
r.next = head;
ListNode p = head;
ListNode q = p.next;
head = q;
while(p != null && q != null){
r.next = q;
p.next = q.next;
q.next = p;
r = p;
p = p.next;
if(p == null || p.next == null) break;
q = p.next;
}
return head;
}
}