-
Notifications
You must be signed in to change notification settings - Fork 25
/
Copy pathDelete_node_in_DLL.java
95 lines (81 loc) · 1.73 KB
/
Delete_node_in_DLL.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
// { Driver Code Starts
//Initial Template for Java
import java.util.*;
class Node {
int data;
Node next;
Node prev;
Node(int d) {
data = d;
next = prev = null;
}
}
class Delete_Node_From_DLL {
Node head;
Node tail;
void addToTheLast(Node node) {
if (head == null) {
head = node;
tail = node;
} else {
tail.next = node;
tail.next.prev = tail;
tail = tail.next;
}
}
void printList(Node head) {
Node temp = head;
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t > 0) {
int n = sc.nextInt();
Delete_Node_From_DLL list = new Delete_Node_From_DLL();
int a1 = sc.nextInt();
Node head = new Node(a1);
list.addToTheLast(head);
for (int i = 1; i < n; i++) {
int a = sc.nextInt();
list.addToTheLast(new Node(a));
}
a1 = sc.nextInt();
Solution g = new Solution();
// System.out.println(list.temp.data);
Node ptr = g.deleteNode(list.head, a1);
list.printList(ptr);
t--;
}
}
}
class Solution {
Node deleteNode(Node head, int x) {
if (head == null)
return null;
if (head.next == null && x == 1)
return null;
if (x == 1) {
head = head.next;
head.prev = null;
return head;
}
Node curr = head;
int count = 2;
while (count <= x) {
curr = curr.next;
count++;
}
if (curr.next == null) {
curr.prev.next = null;
} else {
curr.prev.next = curr.next;
curr.next.prev = curr.prev;
}
return head;
}
}