-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMyLinkedList.java
More file actions
127 lines (107 loc) · 2.84 KB
/
MyLinkedList.java
File metadata and controls
127 lines (107 loc) · 2.84 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
115
116
117
118
119
120
121
122
123
124
125
126
127
package Collection;
public class MyLinkedList extends Node {
Node head = null;
public Node createNode(String name) {
Node node = new Node();
node.name = name;
node.next = null;
return node;
}
public void add(String name) {
Node newNode = createNode(name);
if (head == null) {
head = newNode;
} else {
Node temp = head;
while (temp.next != null) {
temp = temp.next;
}
temp.next = newNode;
}
}
public void addFirst(int data) {
Node newNode = createNode(String.valueOf(data));
if (head == null) {
head = newNode;
} else {
newNode.next = head;
head = newNode;
}
}
public void removeFirst() {
if (head == null) {
System.out.println("List is empty.");
return;
}
head = head.next;
}
public void removeLast() {
if (head == null) {
System.out.println("List is empty");
return;
}
Node temp = head;
while (temp.next.next != null) {
temp = temp.next;
}
temp.next = null;
}
// public void addAt(int index , int data){
// Node newNode = createNode(String.valueOf(data));
//
// if (index == 0){
// newNode.next = head;
// head = newNode;
// }
// head = null;
// temp = head;
// int tempIndex = 0;
//
// while (temp != null && tempIndex < index) {
// head = temp;
// temp = temp.next;
// tempIndex++;
// }
// newNode.next = head;
// head = newNode;
// }
public void remove(int index) {
if (index < 0) {
throw new IndexOutOfBoundsException("Invalid Index: " + index);
}
if (index == 0) {
head = head.next;
return;
}
for (int i = 0; i < index - 1; i++) {
head = head.next;
}
Node temp = head.next;
head.next = temp.next;
}
public void printMyLinkedList() {
Node temp = head;
while (temp != null) {
System.out.println(temp.name);
temp = temp.next;
}
}
public static void main(String[] args) {
MyLinkedList list = new MyLinkedList();
list.add("20");
list.add("30");
list.add("50");
list.add("60");
list.addFirst(100);
list.addFirst(200);
// list.addAt(0 , 10);
// list.addAt(3, 40);
// list.removeAtIndex(1);
// list.remove(3);
list.removeFirst();
System.out.println("First element removed");
list.removeLast();
System.out.println("Last element removed");
list.printMyLinkedList();
}
}