forked from fedeoliv/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdelete_node.cpp
More file actions
73 lines (68 loc) · 1.18 KB
/
Copy pathdelete_node.cpp
File metadata and controls
73 lines (68 loc) · 1.18 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
64
65
66
67
68
69
70
71
72
73
#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct Node
{
int data;
Node *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;
}/*
Delete Node at a given position in a linked list
Node is defined as
struct Node
{
int data;
struct Node *next;
}
*/
Node* Delete(Node *head, int position)
{
Node *node = head;
if(position == 0)
head = head->next;
else {
for(int i = 1; i < position; i++)
node = node->next;
Node *del = node->next;
node->next = del->next;
}
return head;
}void Print(Node* head)
{
while(head != NULL)
{
cout<<head->data;
head=head->next;
}
}
int main()
{
int t;
cin>>t;
while(t-- >0){
int x; cin>>x;
Node *head = NULL;
while(x--)
{
int y;cin>>y;
head = Insert(head,y);
}
int pos;cin>>pos;
head = Delete(head,pos);
Print(head);
cout<<"\n";
}
}