-
Notifications
You must be signed in to change notification settings - Fork 0
/
DeleteaNodeinSingleLinkedList.java
82 lines (74 loc) · 1.65 KB
/
DeleteaNodeinSingleLinkedList.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
import java.util.*;
class Node {
int data;
public Node next;
Node(int d) {
this.data = d;
this.next = null;
}
}
class DeleteNode {
Node head;
void printList(Node head) {
Node temp = head;
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
public void addToTheLast(Node node) {
if (head == null) {
head = node;
} else {
Node temp = head;
while (temp.next != null) {
temp = temp.next;
}
temp.next = node;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t > 0) {
int n = sc.nextInt();
// int k = sc.nextInt();
DeleteNode llist = new DeleteNode();
// int n = Integer.parseInt(br.readLine());
int a1 = sc.nextInt();
Node head = new Node(a1);
llist.addToTheLast(head);
for (int i = 1; i < n; i++) {
int a = sc.nextInt();
llist.addToTheLast(new Node(a));
}
int x = sc.nextInt();
GfG g = new GfG();
// System.out.println(k);
// System.out.println(g.getNthFromLast(llist.head, k));
Node result = g.deleteNode(head, x);
llist.printList(result);
t--;
}
sc.close();
}
}
class GfG {
Node deleteNode(Node head, int x) {
// Your code here
if (x == 1) {
return head.next; // Handle special case for deleting the first node
}
Node curr = head;
Node prev = null;
int count = 2;
while (count <= x) {
prev = curr;
curr = curr.next;
count++;
}
prev.next = curr.next;
return head;
}
}