描述:
给定一个单链表L: L0→L1→…→Ln-1→Ln,
重新排列后为:L0→Ln→L1→Ln-1→L2→Ln-2→…
必须在不改变节点值的情况下进行原地操作。
样例:
给出链表 1->2->3->4->null
,重新排列后为1->4->2->3->null
。
思路:
直接用循环来做 内存超了 后改用递归
/**
* Definition for ListNode.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int val) {
* this.val = val;
* this.next = null;
* }
* }
* 递归节省了大量内存空间
*/
public class Solution {
/**
* @param head: The head of linked list.
* @return: void
*/
public void reorderList(ListNode head) {
// write your code here
if(head == null || head.next == null || head.next.next == null){
return;
}
ListNode low = null;
ListNode high = head;
while(high.next != null){
low = high;
high = high.next;
}
ListNode temp = head.next;
head.next = high;
low.next = null;
reorderList(temp);
high.next = temp;
}
}