问题描述:
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.
做了几道题目以后算是看出来了,这种头结点一直在变化的题目还是递归大法好
代码如下:
/**
* 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 res=swapPairs(head.next.next);
ListNode nextNode;
nextNode=head.next;
nextNode.next=head;
head.next=res;
return nextNode;
}
}