forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution2.ts
81 lines (74 loc) · 1.79 KB
/
Solution2.ts
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
class MyLinkedList {
e: Array<number>;
ne: Array<number>;
idx: number;
head: number;
cnt: number;
constructor() {
this.e = new Array(1010).fill(0);
this.ne = new Array(1010).fill(0);
this.head = -1;
this.idx = 0;
this.cnt = 0;
}
get(index: number): number {
if (index < 0 || index >= this.cnt) {
return -1;
}
let i = this.head;
while (index--) {
i = this.ne[i];
}
return this.e[i];
}
addAtHead(val: number): void {
this.e[this.idx] = val;
this.ne[this.idx] = this.head;
this.head = this.idx++;
this.cnt++;
}
addAtTail(val: number): void {
this.addAtIndex(this.cnt, val);
}
addAtIndex(index: number, val: number): void {
if (index > this.cnt) {
return;
}
if (index <= 0) {
this.addAtHead(val);
return;
}
let i = this.head;
while (--index) {
i = this.ne[i];
}
this.e[this.idx] = val;
this.ne[this.idx] = this.ne[i];
this.ne[i] = this.idx++;
this.cnt++;
}
deleteAtIndex(index: number): void {
if (index < 0 || index >= this.cnt) {
return;
}
this.cnt--;
if (index == 0) {
this.head = this.ne[this.head];
return;
}
let i = this.head;
while (--index) {
i = this.ne[i];
}
this.ne[i] = this.ne[this.ne[i]];
}
}
/**
* Your MyLinkedList object will be instantiated and called as such:
* var obj = new MyLinkedList()
* var param_1 = obj.get(index)
* obj.addAtHead(val)
* obj.addAtTail(val)
* obj.addAtIndex(index,val)
* obj.deleteAtIndex(index)
*/