-
Notifications
You must be signed in to change notification settings - Fork 0
/
1047.删除字符串中的所有相邻重复项.c
136 lines (93 loc) · 2.47 KB
/
1047.删除字符串中的所有相邻重复项.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
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/*
* @lc app=leetcode.cn id=1047 lang=c
*
* [1047] 删除字符串中的所有相邻重复项
*/
// @lc code=start
struct StackNode {
char charValue;
struct StackNode *nextNode;
struct StackNode *lastNode;
};
struct StackNode *stackPointer = NULL;
void pushStack(char root)
{
if (root != NULL) {
// printf("%d, ", root->val);
if (stackPointer != NULL) {
stackPointer->nextNode = malloc(sizeof(struct StackNode));
stackPointer->nextNode->lastNode = stackPointer;
stackPointer = stackPointer->nextNode;
stackPointer->charValue = root;
stackPointer->nextNode = NULL;
}
else {
initStack(root);
}
}
return ;
}
char popStack(void)
{
char resultPointer = NULL;
struct StackNode *lastPointer = NULL;
if (NULL != stackPointer) {
resultPointer = stackPointer->charValue;
lastPointer = stackPointer->lastNode;
free(stackPointer);
stackPointer = lastPointer;
}
return resultPointer;
}
bool isEmptyStack(voi)
{
if (stackPointer == NULL) {
return true;
// printf("%d, ", stackPointer->pointerValue->val);
}
return false;
}
void initStack(char root)
{
stackPointer = NULL;
if (root != NULL) {
stackPointer = malloc(sizeof(struct StackNode));
stackPointer->charValue = root;
stackPointer->nextNode = NULL;
stackPointer->lastNode = NULL;
// printf("%d, ", stackPointer->pointerValue->val);
}
return ;
}
char * removeDuplicates(char * s){
char *strPointer = (s + (strlen(s) - 1));
while (strPointer >= s) {
if (isEmptyStack()) {
pushStack(*strPointer);
}
else {
char middleChar = popStack();
if (middleChar != (*strPointer)) {
pushStack(middleChar);
pushStack(*strPointer);
}
}
strPointer--;
}
strPointer = s;
while (!isEmptyStack()) {
(*strPointer) = popStack();
strPointer++;
}
(*strPointer) = '\0';
/*
strPointer--;
for (char *strPointerLeft = s; strPointerLeft < strPointer; strPointer--, strPointerLeft++) {
char middleChar = (*strPointer);
(*strPointer) = (*strPointerLeft);
(*strPointerLeft) = middleChar;
}
*/
return s;
}
// @lc code=end