min_stack

Author: hitzzc

README.md

@@ -138,6 +138,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [152. maximum product subarray](https://github.com/hitzzc/go-leetcode/tree/master/maximum_product_subarray)
 #### [153. find minimum in rotated sorted array](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array)
 #### [154. find minimum in rotated sorted array II](https://github.com/hitzzc/go-leetcode/tree/master/find_minimum_in_rotated_sorted_array_II)
+#### [155. Min Stack](https://github.com/hitzzc/go-leetcode/tree/master/min_stack)
 
 
 

min_stack/min_stack.cpp

@@ -0,0 +1,34 @@
+#include <stack>
+using namespace std;
+
+class MinStack {
+public:
+
+    MinStack() {
+    
+    }
+    
+    void push(int x) {
+        normal_stack.push(x);
+        if (min_stack.empty() || x <= min_stack.top()) min_stack.push(x);
+        return;
+    }
+    
+    void pop() {
+        int t = normal_stack.top();
+        normal_stack.pop();
+        if (t == min_stack.top()) min_stack.pop();
+        return;
+    }
+    
+    int top() {
+        return normal_stack.top();
+    }
+    
+    int getMin() {
+        return min_stack.top();
+    }
+private:
+    stack<int> normal_stack;
+    stack<int> min_stack;
+};