forked from hariom20singh/data-structure-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked-list.java
109 lines (84 loc) · 2.13 KB
/
linked-list.java
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
class LL {
Node head;
private int size;
LL () {
size = 0;
}
public class Node {
String data;
Node next;
Node(String data) {
this.data = data;
this.next = null;
size++;
}
}
public void addFirst(String data) {
Node newNode = new Node(data);
newNode.next = head;
head = newNode;
}
public void addLast(String data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
return;
}
Node lastNode = head;
while(lastNode.next != null) {
lastNode = lastNode.next;
}
lastNode.next = newNode;
}
public void printList() {
Node currNode = head;
while(currNode != null) {
System.out.print(currNode.data+" -> ");
currNode = currNode.next;
}
System.out.println("null");
}
public void removeFirst() {
if(head == null) {
System.out.println("Empty List, nothing to delete");
return;
}
head = this.head.next;
size--;
}
public void removeLast() {
if(head == null) {
System.out.println("Empty List, nothing to delete");
return;
}
size--;
if(head.next == null) {
head = null;
return;
}
Node currNode = head;
Node lastNode = head.next;
while(lastNode.next != null) {
currNode = currNode.next;
lastNode = lastNode.next;
}
currNode.next = null;
}
public int getSize() {
return size;
}
public static void main(String args[]) {
LL list = new LL();
list.addLast("is");
list.addLast("a");
list.addLast("list");
list.printList();
list.addFirst("this");
list.printList();
System.out.println(list.getSize());
list.removeFirst();
list.printList();
list.removeLast();
list.printList();
}
}