Something went wrong. Try again.
My leetcode submissions.
Something went wrong. Try again.
1.1 kB · 88 lines
C++
at main
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889/* ======================================================================== * * Filename: * Description: * Author: * Version: 0.0.1 * * ======================================================================== */#include <iostream>#include <array>struct Stack { std::array<int, 30000> stack; size_t size;
auto push(int val) -> void { stack[size] = val; size++; }
auto pop() -> void { stack[size] = 0; size--; }
auto top() -> int { return stack[size]; }
[[nodiscard]] auto empty() -> bool { return size == 0; }};
class MinStack { Stack stack; Stack mins;
public: MinStack() { }
void push(int val) { if (mins.val <= mins.top()) stack }
void pop() { }
int top() { }
int getMin() { }};
auto main() -> int{ auto a = MinStack(); a.push(2); a.push(0); a.push(3); a.push(0);
std::cout << a.getMin() << std::endl;
a.pop(); std::cout << a.getMin() << std::endl;
a.pop(); std::cout << a.getMin() << std::endl;
a.pop(); std::cout << a.getMin() << std::endl;
/* std::cout << a.top() << std::endl; std::cout << a.top() << std::endl; */
return 0;}