My leetcode submissions.
stau.space
1/* ========================================================================
2 *
3 * Filename:
4 * Description:
5 * Author:
6 * Version: 0.0.1
7 *
8 * ======================================================================== */
9#include <iostream>
10#include <array>
11struct Stack {
12 std::array<int, 30000> stack;
13 size_t size;
14
15 auto push(int val) -> void
16 {
17 stack[size] = val;
18 size++;
19 }
20
21 auto pop() -> void
22 {
23 stack[size] = 0;
24 size--;
25 }
26
27 auto top() -> int
28 {
29 return stack[size];
30 }
31
32 [[nodiscard]] auto empty() -> bool
33 {
34 return size == 0;
35 }
36};
37
38class MinStack {
39 Stack stack;
40 Stack mins;
41
42public:
43 MinStack()
44 {
45 }
46
47 void push(int val) {
48 if (mins.val <= mins.top())
49 stack
50 }
51
52 void pop() {
53 }
54
55 int top() {
56 }
57
58 int getMin() {
59 }
60};
61
62auto main() -> int
63{
64 auto a = MinStack();
65 a.push(2);
66 a.push(0);
67 a.push(3);
68 a.push(0);
69
70 std::cout << a.getMin() << std::endl;
71
72 a.pop();
73 std::cout << a.getMin() << std::endl;
74
75 a.pop();
76 std::cout << a.getMin() << std::endl;
77
78 a.pop();
79 std::cout << a.getMin() << std::endl;
80
81 /*
82 std::cout << a.top() << std::endl;
83 std::cout << a.top() << std::endl;
84 */
85
86 return 0;
87}
88