-
Notifications
You must be signed in to change notification settings - Fork 110
/
solution.java
78 lines (69 loc) · 2.45 KB
/
solution.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
import java.io.IOException;
import java.util.Scanner;
public class solution {
static class SinglyLinkedListNode {
public int data;
public SinglyLinkedListNode next;
public SinglyLinkedListNode(int nodeData) {
this.data = nodeData;
this.next = null;
}
}
static class SinglyLinkedList {
public SinglyLinkedListNode head;
public SinglyLinkedListNode tail;
public SinglyLinkedList() {
this.head = null;
this.tail = null;
}
public void insertNode(int nodeData) {
SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);
if (this.head == null) {
this.head = node;
} else {
this.tail.next = node;
}
this.tail = node;
}
}
//Member method to print the data of the nodes of singlyLinkedList
public static void printSinglyLinkedList(SinglyLinkedListNode node) throws IOException {
while (node != null) {
System.out.print(node.data + " -> ");
node = node.next;
}
System.out.println("NULL");
}
//Method to get the value of the node
static int getNode(SinglyLinkedListNode head, int positionFromTail) {
SinglyLinkedListNode curr = head;
SinglyLinkedListNode runner = head;
/* Move runner into the list by k elements */
for (int i = 0; i < positionFromTail; i++) {
runner = runner.next;
}
/* Move both pointers */
while (runner.next != null) {
curr = curr.next;
runner = runner.next;
}
return curr.data;
}
private static final Scanner scanner = new Scanner(System.in);
//Driver Code
public static void main(String[] args) throws IOException {
int tests = scanner.nextInt();
for (int testsItr = 0; testsItr < tests; testsItr++) {
SinglyLinkedList llist = new SinglyLinkedList();
int llistCount = scanner.nextInt();
for (int i = 0; i < llistCount; i++) {
int llistItem = scanner.nextInt();
llist.insertNode(llistItem);
}
int position = scanner.nextInt();
int result = getNode(llist.head, position);
System.out.println(result);
}
scanner.close();
}
}