Repository navigation
Expand file tree
/
Copy pathLL1.java
More file actions
122 lines (111 loc) · 2.89 KB
/
Copy pathLL1.java
File metadata and controls
122 lines (111 loc) · 2.89 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
package LL;
public class LL1 {
Node head;
private int size;
LL1(){
this.size = 0;
}
public static void main(String[] args) {
LL1 list = new LL1();
list.addFirst("a");
list.addFirst("ab");
list.addLast("zzzz");
list.printall();
//list.deleteFirst();
//list.printall();
//System.out.println(list.getSize());
list.head = list.reverse(list.head);
list.printall();
}
public static Node reverse(Node head){
if (head == null || head.next==null)
return head;
Node newHead = reverse(head.next);
head.next.next = head;
head.next = null;
return newHead;
/*Node current = head;
Node previous = null;
Node next = null;
while(current != null){
next = current.next;
current.next = previous;
previous = current;
current = next;
}
return previous;*/
}
public int getSize(){
return size;
}
public void deleteFirst(){
if (head == null){
System.out.print("list is empty");
return;
}
size--;
head = head.next;
}
public void deleteLast(){
if (head == null){
System.out.print("list is empty");
return;
}
size--;
if (head.next == null){
head = null;
return;
}
Node secondLast = head;
Node lastNode = head;
while(lastNode.next != null){
lastNode = lastNode.next;
secondLast = secondLast.next;
}
secondLast.next = null;
}
public void addLast(String data){
Node newNode = new Node(data);
//Node head = null;
if (head == null){
head = newNode;
return;
}
Node currNode = head;
while (currNode.next != null){
currNode = currNode.next;
}
currNode.next = newNode;
}
public void printall(){
if (head == null){
System.out.print("no list");
}
Node currNode= head;
while (currNode != null){
System.out.print(currNode.data+"-->");
currNode =currNode.next;
}
System.out.print("nulll");
System.out.println();
}
public void addFirst(String data){
Node newNode = new Node(data);
//Node head = null;
if (head == null){
head = newNode;
return;
}
newNode.next= head;
head = newNode;
}
class Node{
String data;
Node next;
Node(String data){
this.data = data;
this.next = next;
size++;
}
}
}