-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.java
94 lines (79 loc) · 2.22 KB
/
linkedlist.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
// Name = Movaliya Romil Rajeshbhai
// Enrollment no. 202103103510247
// Roll no. 25
// Practical no. 5 -- linkedlist
class linkedlist{
Node head;
class Node{
String data;
Node next;
Node(String data){
this.data=data;
this.next=null;
}
}
public void addFirst(String data) {
Node newNode=new Node(data);
if(head==null){
head=newNode;
return;
}
newNode.next=head;
head=newNode;
}
public void addLast(String data) {
Node newNode=new Node(data);
if(head==null){
head=newNode;
return;
}
Node currNode=head;
while (currNode.next!=null) {
currNode=currNode.next;
}
currNode.next=newNode;
}
public void printlist() {
Node currNode=head;
if(head==null){
System.out.println("list is empty");
}
while (currNode !=null) {
System.out.print(currNode.data+" -> ");
currNode=currNode.next;
}
System.out.print("Null");
}
public void removeFirst(){
if(head==null){
System.out.println("list is empty");
return;
}
head=head.next;
}
public Node removeBefore(Node head, int value) {
if (head == null || head.next == null) {
return null;
}
if (head.next.data == value) {
return head;
}
Node curr = head.next;
Node prev = head;
while (curr.next != null && curr.next.data != value) {
prev = curr;
curr = curr.next;
}
if (curr.next == null) {
return null;
}
prev.next = curr.next;
return head;
}
public static void main(String[] args) {
linkedlist list=new linkedlist();
list.addFirst("romil");
list.addLast("movaliya");
list.printlist();
}
}