-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patheve_odd.java
More file actions
99 lines (93 loc) · 2.07 KB
/
eve_odd.java
File metadata and controls
99 lines (93 loc) · 2.07 KB
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
//playing eve odd with the list
public class Eveodd
{
Node head;
class Node
{
int data;
Node next;
Node(int d)
{
data=d;
next=null;
}
}
public void seperator()
{
Node last = head;
Node prev = null;
Node curr = head;
while(last.next!=null)
last = last.next;
Node n = last;
while(curr.data%2 !=0 && curr!=last)
{
n.next = curr;
curr = curr.next;
n.next.next = null;
n = n.next;
}
if(curr.data%2==0)
{
head = curr;
while(curr!=last){
if(curr.data%2==0)
{
prev = curr;
curr = curr.next;
}
else
{
prev.next = curr.next;
curr.next = null;
n.next=curr;
n=curr;
curr=prev.next;
}
}
}
else
prev=curr;
if(n!=last && last.data%2!=0)
{
prev.next=last.next;
last.next=null;
n.next=last;
}
}
void insert(int element)
{
Node no = new Node(element);
no.next=head;
head=no;
}
void print()
{
Node nod = head;
while(nod.next!=null)
{
System.out.print(nod.data+" ");
nod=nod.next;
}
System.out.println();
}
public static void main(String args[])
{
Eveodd eo = new Eveodd();
eo.insert(11);
eo.insert(99);
eo.insert(84);
eo.insert(93);
eo.insert(72);
eo.insert(64);
eo.insert(43);
eo.insert(2);
eo.insert(14);
eo.insert(3);
System.out.println("Origional Linked List");
eo.print();
eo.seperator();
System.out.println("Final Linked List");
eo.print();
}
}