struct/removeDuplicates.c at main · Quartz1605/struct · GitHub

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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104


#include <stdio.h>
#include <stdlib.h>

typedef struct Node
{

  int data;
  struct Node *next;

} Node;

Node *createNode(int val)
{

  Node *node = (Node *)malloc(sizeof(Node));
  node->data = val;
  node->next = NULL;

  return node;
}

Node *insertEnd(Node *head, int data)
{

  if (!head)
    return createNode(data);

  Node *temp = head;

  while (temp->next != NULL)
  {
    temp = temp->next;
  }

  Node *newNode = createNode(data);

  temp->next = newNode;

  return head;
}

Node *removeDuplicates(Node *head)
{

  Node *temp = head;

  while (temp->next != NULL)
  {

    Node *temp2 = temp;

    if (temp2->data == temp2->next->data)
    {

      temp->next = temp->next->next;
    }
    else
    {
      temp = temp->next;
    }
  }

  return head;
}

void displayLL(Node *head)
{

  Node *temp = head;

  while (temp != NULL)
  {
    printf("%d", temp->data);

    if (temp->next != NULL)
      printf("<->");

    temp = temp->next;
  }
}

int main()
{

  Node *list1 = NULL;

  list1 = insertEnd(list1, 1);
  list1 = insertEnd(list1, 2);
  list1 = insertEnd(list1, 2);
  list1 = insertEnd(list1, 3);
  list1 = insertEnd(list1, 3);
  list1 = insertEnd(list1, 4);
  list1 = insertEnd(list1, 5);
  list1 = insertEnd(list1, 5);
  // list1 = insertEnd(list1,6);

  // list1 = afterPos(list1,17,2);

  list1 = removeDuplicates(list1);

  displayLL(list1);
}