33 155

Author: LuYanFCP

cpp/155.cpp

@@ -0,0 +1,36 @@
+#include<bits/stdc++.h>
+using std::vector;
+
+class MinStack {
+public:
+    vector<int>* stack;
+    vector<int>* min_stack;
+    /** initialize your data structure here. */
+    MinStack() {
+        stack = new vector<int>();
+        min_stack = new vector<int>();
+        min_stack->push_back(INT_MAX);
+    }
+    
+    void push(int x) {
+        stack->push_back(x);
+        int pre_min = min_stack->back();
+        if (x < pre_min) 
+            min_stack->push_back(x);     
+        else
+            min_stack->push_back(pre_min);
+    }
+    
+    void pop() {
+        stack->pop_back();
+        min_stack->pop_back();
+    }
+    
+    int top() {
+        return stack->back();
+    }
+    
+    int getMin() {
+        return min_stack->back();
+    }
+};

python/155.py

@@ -0,0 +1,30 @@
+
+
+MAX_VAL = 10000000000000
+
+class MinStack:
+
+    def __init__(self):
+        """
+        initialize your data structure here.
+        """
+        self.stack = []
+        self.min_stack = [MAX_VAL]
+
+
+    def push(self, x: int) -> None:
+        self.stack.append(x)
+        if x < self.min_stack[-1]:
+            self.min_stack.append(x)
+        else:
+            self.min_stack.append(self.min_stack[-1])
+
+    def pop(self) -> None:
+        self.stack.pop()
+        self.min_stack.pop()
+
+    def top(self) -> int:
+        return self.stack[-1]
+
+    def getMin(self) -> int:
+        return self.min_stack[-1]

python/33.py

@@ -0,0 +1,35 @@
+from typing import List
+
+
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        if len(nums) == 0:
+            return -1
+        l = 0
+        r = len(nums) - 1
+
+        while l < r:
+            mid = (r - l) // 2 + l
+            num_mid = nums[mid]
+            if num_mid >= nums[l]:  # 在左边  
+                if target <= num_mid and target >= nums[l]:  # 由于 r=mid因此可以等于
+                    r = mid
+                else:
+                    l = mid + 1
+            else:
+                if target > num_mid and target <= nums[r]:  # nums[mid] < target < nums[r]
+                    l = mid + 1
+                else:
+                    r = mid
+        
+        if nums[l] == target:
+            return l
+
+        return -1
+
+if __name__ == "__main__":
+    s = Solution()
+    assert(s.search([1,3], 1) == 0)
+    assert(s.search([1,3], 3) == 1)
+    assert(s.search([3,1], 3) == 0)
+    assert(s.search([3,1], 1) == 1)