-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList1.java
99 lines (88 loc) · 2.33 KB
/
LinkedList1.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
public class LinkedList1 {
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
Node head = null;
Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if (head == null) {
head = newNode;
tail = newNode;
} else {
tail.next = newNode;
tail = newNode;
}
}
public int addNodeData(int index1, int index2) {
Node current = head;
int count = 0;
int start = 0, end = 0;
boolean found1 = false, found2 = false;
while (current != null) {
if (count == index1) {
start = current.data;
found1 = true;
}
if (count == index2) {
end = current.data;
found2 = true;
}
if (found1 && found2) {
break;
}
current = current.next;
count++;
}
return start + end;
}
public void removeLastNode() {
if (head == null) {
return;
}
if (head == tail) {
head = null;
tail = null;
} else {
Node current = head;
while (current.next != tail) {
current = current.next;
}
current.next = null;
tail = current;
}
}
public int size() {
int count = 0;
Node current = head;
while (current != null) {
count++;
current = current.next;
}
return count;
}
public void display() {
Node current = head;
while (current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public static void main(String[] args) {
LinkedList1 list = new LinkedList1();
list.addNode(1);
list.addNode(2);
list.addNode(3);
list.addNode(4);
list.display();
list.removeLastNode();
list.display();
System.out.println(list.addNodeData(1, 2));
}
}