-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
100 lines (87 loc) · 2.46 KB
/
Copy pathMain.java
File metadata and controls
100 lines (87 loc) · 2.46 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
package test;
class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}
public class Main {
public static void main(String[] args) {
ListNode listNode = new ListNode(0);
listNode.next= null;
ListNode p = listNode;
for (int i=1;i<10;i++){
ListNode Node = new ListNode(i);
p.next = Node;
p= Node;
}
int index =0;
// while(listNode!=null){
// System.out.print(listNode.val+" "+index+"||");
// index++;
// listNode=listNode.next;
// }
ListNode node1 = new ListNode(0);
ListNode node2 = new ListNode(1);
ListNode node3 = new ListNode(2);
ListNode node4 = new ListNode(3);
ListNode nodea = new ListNode(2);
ListNode nodeb = new ListNode(3);
ListNode nodec = new ListNode(4);
node1.next = node2;
node2.next = node3;
node3.next = node4;
nodea.next = nodeb;
nodeb.next = nodec;
Solution solution = new Solution();
ListNode res = solution.Merge(nodea,nodea);
while (res!=null){
System.out.print(res.val+" ");
res = res.next;
}
}
}
class Solution {
public ListNode Merge(ListNode list1, ListNode list2) {
ListNode List1 = list1;
ListNode List2 = list2;
ListNode newHead = null;
ListNode p = null;
if (List1 == null) {
return list2;
}
if (List2 == null) {
return list1;
}
while (List1 != null && List2 != null) {
if (List1.val <= List2.val) {
if (newHead == null) {
newHead = p = List1;
System.out.println("QQ");
} else {
p.next = List1;
p = p.next;
System.out.println(p.val + "1");
}
List1 = List1.next;
} else {
if (newHead == null) {
newHead = p = List2;
} else {
p.next = List2;
System.out.println(p.val + "1");
p = p.next;
}
List2 = List2.next;
}
}
if (List1 != null) {
p.next = List1;
}
if (List2 != null) {
p.next = List2;
}
return newHead;
}
}