重排链表
题目:
给定一个单链表 L:L0→L1→…→Ln-1→Ln ,
将其重新排列后变为: L0→Ln→L1→Ln-1→L2→Ln-2→…
你不能只是单纯的改变节点内部的值,而是需要实际的进行节点交换。
示例 1:
给定链表 1->2->3->4, 重新排列为 1->4->2->3.
示例 2:
给定链表 1->2->3->4->5, 重新排列为 1->5->2->4->3.
解题思路: 最好想到的就是用遍历链表把链表添加进List然后进行处理.另外一种思路是, 像之前做过的回文链表一样, 找到链表中点然后对后半部分进行逆序修改, 再进行操作(为了偷懒我选择用栈).
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public void reorderList(ListNode head) {
if(head == null || head.next == null)
return ;
ListNode fast = head, slow = head;
int sum = 1;
while(fast.next != null && fast.next.next != null) {
fast = fast.next.next;
slow = slow.next;
sum++;
}
sum = (fast.next == null) ? (sum * 2 - 1) : (sum * 2);
// System.out.println(fast.val);
// System.out.println(slow.val);
// System.out.println(sum);
Stack<ListNode> stack = new Stack();
slow = slow.next;
while(slow != null) {
stack.push(slow);
slow = slow.next;
}
ListNode cur = head;
while(!stack.isEmpty()) {
ListNode s = stack.pop();
ListNode tmp = cur.next;
if(s != tmp)
s.next = tmp;
//长度为偶数时会出现s == tmp情况
else s.next = null;
cur.next = s;
cur = tmp;
}
if(sum % 2 != 0)
cur.next = null;
}
}