-
Notifications
You must be signed in to change notification settings - Fork 0
/
a_120_ZigZag.java
103 lines (83 loc) · 2.35 KB
/
a_120_ZigZag.java
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
public class a_120_ZigZag {
public static class Node{
int data ;
Node next ;
public Node(int data){
this.data = data ;
this.next = null ;
}
}
public static Node head ;
public static Node tail ;
public void addFirst(int data){
// step 1 : Create new Node
Node newNode = new Node(data) ;
if(head == null){
head = tail = newNode ;
return ;
}
// step 2 : newNode next = head
newNode.next = head ; // link
// step 3 : head = newNode
head = newNode ;
}
public void print(){
if(head == null){
System.out.println("Empty Linked List ");
return ;
}
Node temp = head ;
while(temp != null){
System.out.print(temp.data + "->");
temp = temp.next ;
}
System.out.println("null");
}
public void zigZag(){
// find mid
Node slow = head ;
Node fast = head.next ;
while(fast != null && fast.next != null){
slow = slow.next ;
fast = fast.next.next ;
}
Node mid = slow ;
// 2nd half reverse
Node curr = mid.next ;
mid.next = null ;
Node prev = null ;
Node next ;
while(curr != null){
next = curr.next ;
curr.next = prev ;
prev = curr ;
curr = next ;
}
Node leftH = head ; // 1st half head
Node rightH = prev ; // 2nd half head
Node nextL , nextR ;
// alternative merge
while(leftH != null && rightH != null){
// ZigZag merge
nextL = leftH.next ;
leftH.next = rightH ;
nextR = rightH.next ;
rightH.next = nextL ;
// updations
leftH = nextL ;
rightH = nextR ;
}
}
public static void main(String[] args) {
a_120_ZigZag ll = new a_120_ZigZag() ;
// ll.addFirst(6) ;
ll.addFirst(5);
ll.addFirst(4);
ll.addFirst(3);
ll.addFirst(2);
ll.addFirst(1);
ll.print();
ll.zigZag();
ll.print();
}
}