-
Notifications
You must be signed in to change notification settings - Fork 19
/
DeleteByPosition.java
109 lines (70 loc) · 2.05 KB
/
DeleteByPosition.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
import java.io.*;
public class DeleteByPosition {
Node head;
static class Node{
int data;
Node next;
Node(int data){
this.data = data;
this.next = null;
}
}
public static DeleteByPosition deleteAtPosition(DeleteByPosition list , int index) {
Node currNode = list.head;
Node prev = null;
if(index == 0 && currNode != null) {
list.head = currNode.next;
return list;
}
int counter = 0;
while(currNode != null) {
if(counter == index) {
prev.next = currNode.next;
break;
}else {
prev = currNode;
currNode = currNode.next;
counter++;
}
}
if(currNode == null) {
return list;
}
return list;
}
public static void printList(DeleteByPosition list)
{
Node currNode = list.head;
System.out.print("LinkedList: ");
// Traverse through the LinkedList
while (currNode != null) {
// Print the data at current node
System.out.print(currNode.data + " ");
// Go to next node
currNode = currNode.next;
}
System.out.println();
}
public static void main(String[] args) {
DeleteByPosition l = new DeleteByPosition();
l.head = new Node(1);
Node First = new Node(2);
Node third = new Node(3);
Node Fouth = new Node(4);
l.head.next = First;
First.next = third;
third.next = Fouth;
Fouth.next = null;
printList(l);
deleteAtPosition(l,1);
printList(l);
deleteAtPosition(l,2);
printList(l);
deleteAtPosition(l,4);
printList(l);
/* SinglyLinkedList s = new SinglyLinkedList();
s.head = new ListNode(1);
ListNode second = new ListNode(2);
s.head.next = second;*/
}
}