-
Notifications
You must be signed in to change notification settings - Fork 0
/
node_at_given_index.java
86 lines (75 loc) · 1.49 KB
/
node_at_given_index.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
//{ Driver Code Starts
import java.util.*;
import java.lang.*;
class Node
{
int data;
Node next;
Node(int key)
{
data = key;
next = null;
}
}
class nthNode
{
static Node head;
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();
int a1 = sc.nextInt();
Node head = new Node(a1);
addToTheLast(head);
for(int i = 1; i < n; i++)
{
int a = sc.nextInt();
addToTheLast(new Node(a));
}
GfG gfg = new GfG();
System.out.println(gfg.getNth(head, k));
}
}
public static void addToTheLast(Node node)
{
if(head == null)
{
head = node;
}
else
{
Node temp = head;
while(temp.next != null)
temp = temp.next;
temp.next = node;
}
}
}
// } Driver Code Ends
/*node class of the linked list
class Node
{
int data;
Node next;
Node(int key)
{
data = key;
next = null;
}
}
*/
class GfG
{
public static int getNth(Node node, int ind)
{
//Your code here
Node temp=node;
for(int i=1;i<ind;i++){
temp=temp.next;
}
return temp.data;
}
}