-
Notifications
You must be signed in to change notification settings - Fork 0
/
MyLinkedList.java
151 lines (100 loc) · 3.5 KB
/
MyLinkedList.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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
class MyLinkedList {
Node root;
/** Initialize your data structure here. */
public MyLinkedList() {
}
/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
public int get(int index) {
Node focusedNode = root;
while(focusedNode != null && index > 0) {
focusedNode = focusedNode.next;
index--;
}
if(focusedNode == null) return -1;
return focusedNode.value;
}
/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
public void addAtHead(int val) {
Node newNode = new Node(val);
if(root != null) {
root.previous = newNode;
}
newNode.next = root;
root = newNode;
}
/** Append a node of value val to the last element of the linked list. */
public void addAtTail(int val) {
Node newNode = new Node(val);
Node focusedNode = root;
if(focusedNode == null) {
root = newNode;
return;
}
while(focusedNode.next != null) {
focusedNode = focusedNode.next;
}
focusedNode.next = newNode;
newNode.previous = focusedNode;
}
/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
public void addAtIndex(int index, int val) {
if(root == null || index == 0) {
addAtHead(val);
return;
}
Node newNode = new Node(val);
Node focusedNode = root;
while(focusedNode.next != null && index > 0) {
focusedNode = focusedNode.next;
index--;
}
if(index > 1) return;
if(index == 1) {
newNode.previous = focusedNode;
focusedNode.next = newNode;
} else {
newNode.next = focusedNode;
newNode.previous = focusedNode.previous;
focusedNode.previous = newNode;
newNode.previous.next = newNode;
}
}
/** Delete the index-th node in the linked list, if the index is valid. */
public void deleteAtIndex(int index) {
if(root == null) return;
Node focusedNode = root;
if(index == 0) {
root = focusedNode.next;
focusedNode.next.previous = null;
return;
}
while(focusedNode.next != null && index > 0) {
focusedNode = focusedNode.next;
index--;
}
if(index > 0) return;
if(focusedNode.next == null) {
focusedNode.previous.next = null;
return;
}
focusedNode.previous.next = focusedNode.next;
focusedNode.next.previous = focusedNode.previous;
}
public class Node {
int value;
Node next;
Node previous;
public Node(int value) {
this.value = value;
}
}
}
/**
* Your MyLinkedList object will be instantiated and called as such:
* MyLinkedList obj = new MyLinkedList();
* int param_1 = obj.get(index);
* obj.addAtHead(val);
* obj.addAtTail(val);
* obj.addAtIndex(index,val);
* obj.deleteAtIndex(index);
*/