Add Q153, Q154

Author: theFool32

153_FindMinimumInRotatedSortedArray/FindMinimumInRotatedSortedArray.cc

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int findMin(vector<int>& nums) {
+        int len = nums.size();
+        if (len == 0) return 0;
+        if (len == 1) return nums[0];
+        if (len == 2) return min(nums[0], nums[1]);
+        if (nums[0] < nums[len-1]) return nums[0];
+        int mid = (len-1) / 2;
+        if (nums[0] < nums[mid]) {
+            vector<int> temp(nums.begin()+mid, nums.end());
+            return findMin(temp);
+        }
+        vector<int> temp(nums.begin(), nums.begin()+mid+1);
+        return findMin(temp);
+    }
+};

154_FindMinimumInRotatedSortedArray2/FindMinimumInRotatedSortedArray.cc

@@ -0,0 +1,29 @@
+class Solution {
+public:
+    int findMin(vector<int>& nums) {
+        int len = nums.size();
+        if (len == 0) return 0;
+        if (len == 1) return nums[0];
+        if (len == 2) return min(nums[0], nums[1]);
+        if (nums[0] < nums[len-1]) return nums[0];
+        int mid = (len-1) / 2;
+        if (nums[0] > nums[len-1]) {
+            if (nums[0] <= nums[mid]) {
+                vector<int> temp(nums.begin()+mid, nums.end());
+                return findMin(temp);
+            }
+            vector<int> temp(nums.begin(), nums.begin()+mid+1);
+            return findMin(temp);
+        }
+        if (nums[0] < nums[mid]) {
+            vector<int> temp(nums.begin()+mid, nums.end());
+            return findMin(temp);
+        } else if (nums[0] > nums[mid]) {
+            vector<int> temp(nums.begin(), nums.begin()+mid+1);
+            return findMin(temp);
+        }
+        vector<int> temp(nums.begin()+mid, nums.end());
+        vector<int> temp1(nums.begin(), nums.begin()+mid+1);
+        return min(findMin(temp), findMin(temp1));
+    }
+};