-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_min_stack.c
76 lines (54 loc) · 1.56 KB
/
_min_stack.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
typedef struct {
int cap;
int len;
int min;
int* elements;
} MinStack;
/** initialize your data structure here. */
MinStack* minStackCreate(int maxSize) {
MinStack* stack = (MinStack*)malloc(sizeof(MinStack));
stack -> elements = (int*)malloc(sizeof(int)*maxSize);
stack -> cap = maxSize;
stack -> len = 0;
stack -> min = INT_MAX;
return stack;
}
void minStackPush(MinStack* stack, int x) {
if(stack -> len >= stack -> cap)
return;
if(x < stack -> min)
stack -> min = x;
stack -> elements[stack -> len] = x; stack -> len++;
}
void minStackPop(MinStack* stack) {
if(stack -> len == 0)
return;
stack -> len--;
if(stack -> min == stack -> elements[stack -> len]) {
stack -> min = INT_MAX;
for(int index = 0; index < stack -> len; index++)
if(stack -> elements[index] < stack -> min)
stack -> min = stack -> elements[index];
}
}
int minStackTop(MinStack* stack) {
return stack -> elements[stack -> len - 1];
}
int minStackGetMin(MinStack* stack) {
return stack -> min;
}
void minStackFree(MinStack* stack) {
for(int index = 0; index < stack -> len; index++)
printf("[%d] -> ", stack -> elements[index]);
printf("\n");
free(stack);
}
/**
* Your MinStack struct will be instantiated and called as such:
* struct MinStack* obj = minStackCreate(maxSize);
* minStackPush(obj, x);
* minStackPop(obj);
* int param_3 = minStackTop(obj);
* int param_4 = minStackGetMin(obj);
* minStackFree(obj);
*/