-
Notifications
You must be signed in to change notification settings - Fork 4
/
0707-design-linked-list.cpp
92 lines (79 loc) · 1.95 KB
/
0707-design-linked-list.cpp
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
class Node {
public:
int val;
Node* next;
Node(int val): val(val), next(NULL) {}
Node(int val, Node* next): val(val), next(next) {}
};
class MyLinkedList {
Node* head = NULL;
public:
MyLinkedList() {}
void print(Node* head) {
auto itr = head;
while (itr) {
cout<<itr->val<<endl;
itr = itr->next;
}
}
int get(int index) {
// print(head);
auto itr = head;
while(index--) {
if (!itr) return -1;
itr = itr->next;
}
return itr ? itr->val: -1;
}
void addAtHead(int val) {
auto to_add = new Node(val, NULL);
to_add->next = head;
head = to_add;
}
void addAtTail(int val) {
auto to_add = new Node(val);
if (!head) {
head = to_add;
return;
}
auto itr = head;
while (itr->next) itr = itr->next;
itr->next = to_add;
}
void addAtIndex(int index, int val) {
if (index == 0) {
addAtHead(val);
return;
}
auto itr = head;
while (--index) {
if (!itr) return;
itr = itr->next;
}
if (!itr) return;
auto to_add = new Node(val, itr->next);
itr->next = to_add;
}
void deleteAtIndex(int index) {
if (index == 0) {
head = head->next;
return;
}
auto itr = head;
while (--index) {
if (!itr) return;
itr = itr->next;
}
if (!itr) return;
itr->next = itr->next ? itr->next->next: 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);
*/