-
Notifications
You must be signed in to change notification settings - Fork 0
/
reorder-list.cs
44 lines (38 loc) · 1.03 KB
/
reorder-list.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// https://leetcode.com/problems/reorder-list/
/**
* Definition for singly-linked list.
* public class ListNode {
* public int val;
* public ListNode next;
* public ListNode(int val=0, ListNode next=null) {
* this.val = val;
* this.next = next;
* }
* }
*/
public class Solution {
public void ReorderList(ListNode head) {
Stack<ListNode> stack = new Stack<ListNode>();
ListNode last = head;
while(last != null){
stack.Push(last);
last = last.next;
}
ListNode actualHead = head;
while(true){
if(actualHead == stack.Peek()){
actualHead.next = null;
break;
}
ListNode temp = actualHead.next;
ListNode top = stack.Pop();
if(actualHead.next == top){
top.next = null;
break;
}
actualHead.next = top;
top.next = temp;
actualHead = temp;
}
}
}