-
Notifications
You must be signed in to change notification settings - Fork 25
/
Copy pathremovingDuplicates.c
76 lines (69 loc) · 1.14 KB
/
removingDuplicates.c
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
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int data;
struct Node * next;
}*head = NULL , *last = NULL ;
struct Node * createNode(int value)
{
struct Node * node = (struct Node *)malloc(sizeof(struct Node));
node->data = value;
node->next = NULL;
return node;
}
void createLinkList(int value)
{
struct Node * node;
node = createNode(value);
if(head == NULL)
{
head = last = node ;
}
else
{
last->next = node ;
last = node;
}
}
void removeDuplicate(struct Node *head)
{
struct Node * current = head->next;
while(current != NULL)
{
if(current->data != head->data ){
head = current;
current = current->next;
}
else{
head->next = current->next;
free(current);
current = head->next;
}
}
}
void ShowList(struct Node * head)
{
while(head != NULL)
{
printf("%d ", head->data);
head = head->next;
}
}
int main()
{
int nodes,value;
printf("Enter number of nodes :\n");
scanf("%d", &nodes);
printf("enter all values of list\n");
for(int i = 0; i < nodes; i++)
{
scanf("%d", &value);
createLinkList(value);
}
ShowList(head);
removeDuplicate(head);
printf("\n");
ShowList(head);
return 0;
}