/
DeleteDuplicate.cpp
92 lines (68 loc) · 1.65 KB
/
DeleteDuplicate.cpp
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
#include "StdAfx.h"
#include <stdlib.h>
#include <iostream>
struct ListNode
{
int val;
ListNode *next;
//ListNode(int x) : val(x), next(NULL) {}
};
void printLinkedList(ListNode* start)
{
ListNode* point = start;
while(point!= NULL)
{
std::cout << point->val << std::endl;
point = point->next;
}
}
ListNode* createLinkedList()
{
// create a linkedList 2,1,1,4
const int count = 4;
int valueArray[count] = {2,1,1,4};
ListNode* a = new ListNode();
a->val = valueArray[0];
ListNode* b = new ListNode();
b->val = valueArray[1];
ListNode* c = new ListNode();
c->val = valueArray[2];
ListNode* d = new ListNode();
d->val = valueArray[3];
a->next = b;
b->next = c;
c->next = d;
d->next = NULL;
return a;
}
class Solution {
public:
static ListNode *deleteDuplicates(ListNode *head)
{
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode *frontPointer;
ListNode *backPointer;
frontPointer = head;
backPointer = head;
while (frontPointer != NULL)
{
if(frontPointer->val != backPointer->val)
{
backPointer = backPointer->next;
backPointer->val = frontPointer->val;
}
frontPointer = frontPointer->next;
}
backPointer->next = NULL;
return head;
}
};
void main()
{
//std::cout<< "hello world";
ListNode* start = createLinkedList();
ListNode* result = Solution::deleteDuplicates(start);
printLinkedList(result);
std::cin;
}