-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedList1.java
More file actions
100 lines (92 loc) · 2.22 KB
/
LinkedList1.java
File metadata and controls
100 lines (92 loc) · 2.22 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
public class LinkedList1{
//707. Design Linked List [NOT OPTIMISED]
class Node{
int val;
Node next;
}
Node head;
int size ;
public void MyLinkedList() {
head = null;
size = 0;
}
public int get(int index) {
if(index+1 > size) return -1;
int i = 0;
Node temp = head;
while(i!=index){
temp = temp.next;
i++;
}
return temp.val;
}
public void addAtHead(int val) {
Node temp = new Node();
temp.val = val;
temp.next = head;
head = temp;
size++;
}
public void addAtTail(int val) {
Node temp = head;
size++;
Node newNode = new Node();
newNode.val = val;
newNode.next = null;
if(temp == null){
head = newNode;
return;
}
while(temp.next != null){
temp = temp.next;
}
temp.next = newNode;
}
public void addAtIndex(int index, int val) {
if(size == index){
addAtTail(val);
}else if(size < index){
return;
}else{
Node newNode = new Node();
newNode.val = val;
newNode.next = null;
if(index == 0){
newNode.next = head;
head = newNode;
size++;
return;
}
Node temp = head;
int i=0;
while(index-1 > i){
temp = temp.next;
i++;
}
newNode.next = temp.next;
temp.next = newNode;
size++;
}
}
public void deleteAtIndex(int index) {
if(index < size && index >= 0){
if(index == 0) {
head = head.next;
size--;
return;
}
Node temp = head;
int i=0;
while(i < index-1){
temp = temp.next;
i++;
}
if(temp.next != null) {
temp.next = temp.next.next;
}
size--;
}
}
public static void main(String[] args) {
}
}