Repository navigation
Expand file tree
/
Copy pathproblem328.java
More file actions
99 lines (72 loc) · 2.02 KB
/
Copy pathproblem328.java
File metadata and controls
99 lines (72 loc) · 2.02 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
//328. Odd Even Linked List
class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}
public class problem328 {
public static ListNode oddEvenList(ListNode head) {
if(head == null)
return null;
int c=1;
ListNode odd ;
ListNode even;
odd=null; even=null;
ListNode temp = head;
ListNode oddp=odd, evenp=even;
while(temp!=null)
{
if(c%2!=0)
{
if(odd==null)
{
odd = new ListNode(temp.val);
oddp=odd;
}
else{
ListNode t = new ListNode(temp.val);
oddp.next=t;
oddp=t;
}
}
else{
if(even==null)
{
even = new ListNode(temp.val);
evenp=even;
}
else{
ListNode t = new ListNode(temp.val);
evenp.next=t;
evenp=t;
}
}
temp=temp.next;
c++;
}
head=odd;
oddp.next=even;
printList(head);
return head;
}
public static void printList(ListNode head) {
ListNode temp = head;
while (temp != null) {
System.out.print(temp.val + " -> ");
temp = temp.next;
}
System.out.println("null");
}
public static void main(String[] args) {
int[] arr = {2,1,3,5,6,4,7};
ListNode head = new ListNode(arr[0]);
ListNode current = head;
for (int i = 1; i < arr.length; i++) {
current.next = new ListNode(arr[i]);
current = current.next;
}
printList(oddEvenList(head));
}
}