update: 33 & 153 & 154

Author: hijiangtao

README.md

@@ -47,6 +47,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [JavaScript](./src/set-matrix-zeroes/res.js)|Medium|
 |75|[Sort Colors](https://leetcode.com/problems/sort-colors/) | [JavaScript](./src/sort-colors/res.js)|Medium|
 |80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [JavaScript](./src/remove-duplicates-from-sorted-array-ii/res.js)|Medium|
+|81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | [JavaScript](./src/search-in-rotated-sorted-array-ii/res.js)|Medium|
 |88|[	Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [JavaScript](./src/merge-sorted-array/res.js)|Medium|
 |91|[Decode Ways](https://leetcode.com/problems/decode-ways/) | [JavaScript](./src/decode-ways/res.js)|Medium|
 |93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | [JavaScript](./src/restore-ip-addresses/res.js)|Medium|
@@ -64,6 +65,8 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |137|[Single Number II](https://leetcode.com/problems/single-number-ii/) | [JavaScript](./src/single-number-ii/res.js)|Medium|
 |151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | [JavaScript](./src/reverse-words-in-a-string/res.js)|Medium|
 |152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [JavaScript](./src/maximum-product-subarray/res.js)|Medium|
+|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [JavaScript](./src/find-minimum-in-rotated-sorted-array/res.js)|Medium|
+|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) | [JavaScript](./src/find-minimum-in-rotated-sorted-array-ii/res.js)|Medium|
 |164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/) | [JavaScript](./src/maximum-gap/res.js)|Hard|
 |165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | [JavaScript](./src/compare-version-numbers/res.js)|Medium|
 |175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)| [SQL](./src/combine-two-tables/res.txt)|Easy|

src/find-minimum-in-rotated-sorted-array-ii/res.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMin = function(nums) {
+  const len = nums.length;
+  let left = 0, right = len - 1;
+  
+  while(left < right) {
+    const mid = (left + right) >> 1;
+
+    if (nums[mid] > nums[right]) {
+      left = mid + 1;
+    } else if (nums[mid] < nums[right]) {
+      right = mid;
+    } else {
+      right -= 1;
+    }
+  }
+
+  return nums[left];
+};

src/find-minimum-in-rotated-sorted-array/res.js

@@ -0,0 +1,21 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findMin = function(nums) {
+  const len  = nums.length;
+  let left = 0, right = len-1;
+  if (len === 1 || nums[left] < nums[right]) return nums[0];
+
+  while (left < right) {
+    const mid = (left + right) >> 1;
+
+    if (nums[left] > nums[mid] || nums[mid] < nums[right]) {
+      right = mid;
+    } else if (nums[left] < nums[mid] || nums[mid] > nums[right]) {
+      left = mid + 1;
+    }
+  }
+
+  return nums[left];
+};

src/search-in-rotated-sorted-array-ii/res.js

@@ -0,0 +1,41 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {boolean}
+ */
+var search = function(nums, target) {
+  const len = nums.length;
+
+  if(nums[0] === nums[len-1]) {
+    if (nums[0] === target) return true;
+    else {
+      let index = false;
+      nums.map((e, i) => {
+        if (e === target) index = i;
+      });
+      if (index) return true;
+    }
+  } else {
+    return subsearch(nums, target);
+  }
+
+  return false;
+};
+
+const subsearch = (nums, target) => {
+  let lo = 0, hi = nums.length - 1;
+
+    while (lo < hi) {
+        let mid = (lo + hi) >> 1;
+
+        if (nums[0] <= nums[mid] && (target > nums[mid] || target < nums[0])) {
+            lo = mid + 1;
+        } else if (target < nums[0] && target > nums[mid]) {
+            lo = mid + 1;
+        } else {
+            hi = mid;
+        }
+    }
+
+    return lo == hi && nums[lo] == target;
+}