-
-
Notifications
You must be signed in to change notification settings - Fork 8.8k
/
Copy pathSolution.java
62 lines (55 loc) · 1.3 KB
/
Solution.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
class MyLinkedList {
private ListNode dummy = new ListNode();
private int cnt;
public MyLinkedList() {
}
public int get(int index) {
if (index < 0 || index >= cnt) {
return -1;
}
var cur = dummy.next;
while (index-- > 0) {
cur = cur.next;
}
return cur.val;
}
public void addAtHead(int val) {
addAtIndex(0, val);
}
public void addAtTail(int val) {
addAtIndex(cnt, val);
}
public void addAtIndex(int index, int val) {
if (index > cnt) {
return;
}
var pre = dummy;
while (index-- > 0) {
pre = pre.next;
}
pre.next = new ListNode(val, pre.next);
++cnt;
}
public void deleteAtIndex(int index) {
if (index < 0 || index >= cnt) {
return;
}
var pre = dummy;
while (index-- > 0) {
pre = pre.next;
}
var t = pre.next;
pre.next = t.next;
t.next = null;
--cnt;
}
}
/**
* 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);
*/