forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
71 lines (63 loc) · 1.52 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
63
64
65
66
67
68
69
70
71
class MyLinkedList {
private int[] e = new int[1000];
private int[] ne = new int[1000];
private int head = -1;
private int idx;
private int size;
public MyLinkedList() {
}
public int get(int index) {
if (index < 0 || index >= size) {
return -1;
}
int i = head;
for (; index > 0; i = ne[i], index--);
return e[i];
}
public void addAtHead(int val) {
e[idx] = val;
ne[idx] = head;
head = idx++;
size++;
}
public void addAtTail(int val) {
addAtIndex(size, val);
}
public void addAtIndex(int index, int val) {
if (index > size) {
return;
}
if (index <= 0) {
addAtHead(val);
return;
}
int i = head;
for (; index > 1; i = ne[i], index--);
e[idx] = val;
ne[idx] = ne[i];
ne[i] = idx++;
size++;
}
public void deleteAtIndex(int index) {
if (index < 0 || index >= size) {
return;
}
size--;
if (index == 0) {
head = ne[head];
return;
}
int i = head;
for (; index > 1; i = ne[i], index--);
ne[i] = ne[ne[i]];
}
}
/**
* 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);
*/