forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDesign Linked List.java
More file actions
114 lines (105 loc) · 3.06 KB
/
Design Linked List.java
File metadata and controls
114 lines (105 loc) · 3.06 KB
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
class MyLinkedList {
/** Initialize your data structure here. */
Node head;
Node tail;
int count;
public MyLinkedList() {
head = new Node(-1);
tail = new Node(-1);
head.next = tail;
tail.prev = head;
count = 0;
}
/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
public int get(int index) {
if (index < 0 || index >= count) {
return -1;
}
Node curr = head.next;
int idx = 0;
while (idx < index) {
idx++;
curr = curr.next;
}
return curr.val;
}
/** 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);
newNode.next = head.next;
newNode.prev = head;
head.next.prev = newNode;
head.next = newNode;
count++;
}
/** Append a node of value val to the last element of the linked list. */
public void addAtTail(int val) {
Node newNode = new Node(val);
newNode.prev = tail.prev;
newNode.next = tail;
tail.prev.next = newNode;
tail.prev = newNode;
count++;
}
/** 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 (index < 0 || index > count) {
return;
}
if (index == 0) {
addAtHead(val);
}
else if (index == count) {
addAtTail(val);
}
else {
int idx = 0;
Node curr = head;
while (idx < index) {
idx++;
curr = curr.next;
}
Node newNode = new Node(val);
newNode.prev = curr;
newNode.next = curr.next;
curr.next.prev = newNode;
curr.next = newNode;
count++;
}
}
/** Delete the index-th node in the linked list, if the index is valid. */
public void deleteAtIndex(int index) {
if (index < 0 || index >= count) {
return;
}
int idx = 0;
Node curr = head;
while (idx < index) {
idx++;
curr = curr.next;
}
Node next = curr.next.next;
next.prev = curr;
curr.next = next;
count--;
}
}
class Node {
int val;
Node next;
Node prev;
public Node(int val) {
this.val = val;
next = null;
prev = null;
}
}
/**
* 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);
*/