LeetCode-24 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.
我的代码:
/**
* 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 firstflag = new ListNode(0);
ListNode temp = new ListNode(0);
temp = head.next;
ListNode flag = new ListNode(0);
firstflag.next = head.next;
flag = temp.next;
if (flag == null) {//只有两个节点的情况。
temp.next = head;
head.next = null;
return temp;
}
while( true ){//这部分大概要看着代码画出来比较好理解。。
temp.next = head;
temp = flag.next;
if (temp != null ) {
head.next = temp;
head = flag;
flag = temp.next;
if (flag == null) {
temp.next = head;
head.next = null;
break;
}
}else{
head.next = flag;
break;
}
}
return firstflag.next;
}
}
Runtime: 270 ms
一共需要3个节点进行不断的交换连接神马的,
开始时:第一个节点为head,第二个为temp,第三个节点为flag;
一轮后:第三个节点变为head(即head = flag),第四个节点变为temp,第五个节点t变为flag;
二轮后:..........依次推进。
代码可能不够简洁,但是花了好多时间想,还是只做到这样。
别人的代码:
/**
* 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 null;
if (head.next == null) return head;
ListNode newhead = head.next;
head.next = swapPairs(head.next.next);
newhead.next = head;
return newhead;
}
}
Runtime: 326 ms
递归的做法。简洁多了= =。
但递归的效率比迭代慢些。在这算是体现出来一些。