forked from fedeoliv/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvalue_node.cpp
More file actions
63 lines (59 loc) · 1 KB
/
Copy pathvalue_node.cpp
File metadata and controls
63 lines (59 loc) · 1 KB
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
#include <iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct Node
{
int data;
Node *next;
};int GetNode(Node *head,int positionFromTail)
{
if(head == NULL) return 0;
Node *first = head;
Node *sec = head;
for(int i = 0; i < positionFromTail; i++)
sec = sec->next;
while(sec->next != NULL) {
sec = sec->next;
first = first->next;
}
return first->data;
}void Print(Node *head)
{
bool ok = false;
while(head != NULL)
{
if(ok)cout<<" ";
else ok = true;
cout<<head->data;
head = head->next;
}
}
Node* Insert(Node *head,int x)
{
Node *temp = new Node();
temp->data = x;
temp->next = NULL;
if(head == NULL)
{
return temp;
}
Node *temp1;
for(temp1 = head;temp1->next!=NULL;temp1= temp1->next);
temp1->next = temp;return head;
}
int main()
{
int t;
cin>>t;
while(t-- >0)
{
Node *A = NULL;
int m;cin>>m;
while(m--){
int x; cin>>x;
A = Insert(A,x);}
int n;cin>>n;
cout<<GetNode(A,n)<<"\n";
}
}