Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
53 lines (39 loc) · 1.57 KB

File metadata and controls

53 lines (39 loc) · 1.57 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms.algorithm.others;
public class Insertion_Link {
public static void main(String[] str) {
Insertion_Link il = new Insertion_Link();
ListNode head = new ListNode(-5);
head.next = new ListNode(4);
head.next.next = new ListNode(1);
head.next.next.next = new ListNode(2);
head.next.next.next.next = new ListNode(6);
head.next.next.next.next.next = new ListNode(7);
//il.insertionSortList(head);
String s = "//...";
String[] stub = s.split("/+");
System.out.print(stub.toString());
}
public ListNode insertionSortList(ListNode head) {
ListNode dummy = new ListNode(0);
while (head != null) {
ListNode node = dummy;
while (node.next != null && node.next.val < head.val) {
//System.out.print(head.toString());
node = node.next;
//System.out.print("After print node ");
//System.out.print(node.toString());
}
System.out.print("Node: ");
System.out.print(node.toString());
System.out.print("Head: ");
System.out.print(head.toString());
ListNode temp = head.next;
head.next = node.next;
node.next = head;
head = temp;
System.out.print("print dummy: ");
System.out.print(dummy.toString());
}
return dummy.next;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.