forked from IDeserve/learn
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLinkedList.java
113 lines (94 loc) · 2.38 KB
/
LinkedList.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
104
105
106
107
108
109
110
111
112
113
package list;
public class LinkedList {
Node head, tail;
LinkedList()
{
}
class Node
{
int value;
Node next;
Node(int value)
{
this.value = value;
}
}
public void addNode(int value)
{
Node temp = new Node(value);
if (head == null)
{
head = tail = temp;
return;
}
tail.next = temp;
tail = temp;
}
public void printList()
{
Node temp = head;
while (temp != null)
{
System.out.print(temp.value + "->");
temp = temp.next;
}
System.out.print("Null\n\n");
}
public void segregateOddEven()
{
Node oddHead = null, evenHead = null, lastOdd = null, lastEven = null;
Node temp = this.head;
while (temp != null)
{
if (temp.value % 2 == 0) // even node
{
if (evenHead == null) // group even nodes together
{
evenHead = lastEven = temp;
}
else
{
lastEven.next = temp;
lastEven = temp;
}
}
else // group odd nodes together
{
if (oddHead == null)
{
oddHead = lastOdd = temp;
}
else
{
lastOdd.next = temp;
lastOdd = temp;
}
}
temp = temp.next;
}
if (evenHead != null) // put even nodes in the beginning of the list
{
this.head = evenHead;
}
if (lastEven != null) // now link odd nodes to even nodes
{
lastEven.next = oddHead;
}
if (lastOdd != null) // finally mark the end of the linked list
{
lastOdd.next = null;
}
}
public static void main(String[] args)
{
LinkedList list = new LinkedList();
list.addNode(2);
list.addNode(2);
list.addNode(4);
list.addNode(6);
list.addNode(8);
list.printList();
list.segregateOddEven();
list.printList();
}
}