-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathLinked List at ending.cpp
More file actions
86 lines (72 loc) · 1.2 KB
/
Linked List at ending.cpp
File metadata and controls
86 lines (72 loc) · 1.2 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
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
struct node
{
int data;
struct node* next;
};
struct node* head=NULL;
struct node* ptr=NULL;
void insert(int num)
{
struct node * temp;
temp=(struct node*)malloc(sizeof(struct node));
temp->data=num;
temp->next=NULL;
if(head==NULL)
{
head=temp;
ptr=head;
}
else
{
ptr->next=temp;
ptr=temp;
}
}
void delete()
{
if(head==NULL)
{
return;
}
struct node*b=head;
while((b->next->next)!=NULL)
{
b=b->next;
}
free(b->next);
b->next=NULL;
}
void display()
{
struct node * ptr1;
ptr1=head;
while(ptr1->next!=NULL)
{
printf("%d->",ptr1->data);
ptr1=ptr1->next;
}
printf("%d",ptr1->data);
}
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n;
scanf("%d",&n);
while(n--)
{
int num;
scanf("%d",&num);
insert(num);
}
int k;
scanf("%d",&k);
while(k--)
{
delete();
}
display();
return 0;
}