feat: add python and java solutions to leetcode problem: No.0153,0154

* https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/
* https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array-ii/

Author: yanglbme

README.md

@@ -55,6 +55,8 @@
 1. [三数之和](/solution/0000-0099/0015.3Sum/README.md)
 1. [四数之和](/solution/0000-0099/0018.4Sum/README.md)
 1. [合并两个有序数组](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md)
+1. [寻找旋转排序数组中的最小值](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md)
+1. [寻找旋转排序数组中的最小值 II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md)
 
 ### 字符串
 

README_EN.md

@@ -54,6 +54,8 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 1. [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md)
 1. [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md)
 1. [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md)
+1. [Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md)
+1. [Find Minimum in Rotated Sorted Array II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md)
 
 ### Strings
 

lcof/面试题11. 旋转数组的最小数字/README.md

@@ -27,53 +27,35 @@
 ```python
 class Solution:
     def minArray(self, numbers: List[int]) -> int:
-        if len(numbers) == 1 or numbers[0] < numbers[-1]:
-            return numbers[0]
-        left, right = 0, len(numbers) - 1
-        while (right - left > 1):
-            mid = left + ((right - left) >> 1)
-            if numbers[mid] == numbers[left] == numbers[right]:
-                return min(numbers[left: right + 1])
-            if numbers[mid] >= numbers[left]:
-                left = mid
-            elif numbers[mid] <= numbers[right]:
-                right = mid
-        return numbers[right]
+        l, r = 0, len(numbers) - 1
+        while l < r:
+            m = l + ((r - l) >> 1)
+            if numbers[m] > numbers[r]:
+                l = m + 1
+            elif numbers[m] < numbers[r]:
+                r = m
+            else:
+                r -= 1
+        return numbers[l]
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public int minArray(int[] numbers) {
-        int len = numbers.length;
-        if (len == 1 || numbers[0] < numbers[len - 1]) {
-            return numbers[0];
-        }
-
-        int left = 0, right = len - 1;
-        while (right - left > 1) {
-            int mid = left + ((right - left) >> 1);
-            if (numbers[left] == numbers[mid] && numbers[mid] == numbers[right]) {
-                return findMin(numbers, left, right);
-            }
-            if (numbers[mid] >= numbers[left]) {
-                left = mid;
-            } else if (numbers[mid] <= numbers[right]) {
-                right = mid;
-            }
-        }
-        return numbers[right];
-    }
-
-    private int findMin(int[] numbers, int left, int right) {
-        int min = numbers[left];
-        for (int i = left + 1; i < right; ++i) {
-            if (min > numbers[i]) {
-                min = numbers[i];
+        int l = 0, r = numbers.length - 1;
+        while (l < r) {
+            int m = l + ((r - l) >> 1);
+            if (numbers[m] > numbers[r]) {
+                l = m + 1;
+            } else if (numbers[m] < numbers[r]) {
+                r = m;
+            } else {
+                --r;
             }
         }
-        return min;
+        return numbers[l];
     }
 }
 ```

lcof/面试题11. 旋转数组的最小数字/Solution.java

@@ -1,32 +1,16 @@
 class Solution {
     public int minArray(int[] numbers) {
-        int len = numbers.length;
-        if (len == 1 || numbers[0] < numbers[len - 1]) {
-            return numbers[0];
-        }
-
-        int left = 0, right = len - 1;
-        while (right - left > 1) {
-            int mid = left + ((right - left) >> 1);
-            if (numbers[left] == numbers[mid] && numbers[mid] == numbers[right]) {
-                return findMin(numbers, left, right);
-            }
-            if (numbers[mid] >= numbers[left]) {
-                left = mid;
-            } else if (numbers[mid] <= numbers[right]) {
-                right = mid;
-            }
-        }
-        return numbers[right];
-    }
-
-    private int findMin(int[] numbers, int left, int right) {
-        int min = numbers[left];
-        for (int i = left + 1; i < right; ++i) {
-            if (min > numbers[i]) {
-                min = numbers[i];
+        int l = 0, r = numbers.length - 1;
+        while (l < r) {
+            int m = l + ((r - l) >> 1);
+            if (numbers[m] > numbers[r]) {
+                l = m + 1;
+            } else if (numbers[m] < numbers[r]) {
+                r = m;
+            } else {
+                --r;
             }
         }
-        return min;
+        return numbers[l];
     }
 }

lcof/面试题11. 旋转数组的最小数字/Solution.py

@@ -1,14 +1,12 @@
 class Solution:
     def minArray(self, numbers: List[int]) -> int:
-        if len(numbers) == 1 or numbers[0] < numbers[-1]:
-            return numbers[0]
-        left, right = 0, len(numbers) - 1
-        while (right - left > 1):
-            mid = left + ((right - left) >> 1)
-            if numbers[mid] == numbers[left] == numbers[right]:
-                return min(numbers[left: right + 1])
-            if numbers[mid] >= numbers[left]:
-                left = mid
-            elif numbers[mid] <= numbers[right]:
-                right = mid
-        return numbers[right]
+        l, r = 0, len(numbers) - 1
+        while l < r:
+            m = l + ((r - l) >> 1)
+            if numbers[m] > numbers[r]:
+                l = m + 1
+            elif numbers[m] < numbers[r]:
+                r = m
+            else:
+                r -= 1
+        return numbers[l]

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README.md

@@ -41,15 +41,41 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        l, r = 0, len(nums) - 1
+        while l < r:
+            m = l + ((r - l) >> 1)
+            if nums[m] > nums[r]:
+                l = m + 1
+            elif nums[m] < nums[r]:
+                r = m
+            else:
+                r -= 1
+        return nums[l]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int findMin(int[] nums) {
+        int l = 0, r = nums.length - 1;
+        while (l < r) {
+            int m = l + ((r - l) >> 1);
+            if (nums[m] > nums[r]) {
+                l = m + 1;
+            } else if (nums[m] < nums[r]) {
+                r = m;
+            } else {
+                --r;
+            }
+        }
+        return nums[l];
+    }
+}
 ```
 
 ### **...**

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/README_EN.md

@@ -42,13 +42,39 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        l, r = 0, len(nums) - 1
+        while l < r:
+            m = l + ((r - l) >> 1)
+            if nums[m] > nums[r]:
+                l = m + 1
+            elif nums[m] < nums[r]:
+                r = m
+            else:
+                r -= 1
+        return nums[l]
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int findMin(int[] nums) {
+        int l = 0, r = nums.length - 1;
+        while (l < r) {
+            int m = l + ((r - l) >> 1);
+            if (nums[m] > nums[r]) {
+                l = m + 1;
+            } else if (nums[m] < nums[r]) {
+                r = m;
+            } else {
+                --r;
+            }
+        }
+        return nums[l];
+    }
+}
 ```
 
 ### **...**

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/Solution.java

@@ -1,14 +1,16 @@
 class Solution {
     public int findMin(int[] nums) {
-        int left = 0 , right = nums.length - 1;
-        while(left < right){
-            int mid = left + (right - left) / 2;
-            if(nums[left] > nums[mid]){
-                left++;
-                right = mid;
-            }else if(nums[mid] > nums[right]) left = mid + 1;
-            else right--;
+        int l = 0, r = nums.length - 1;
+        while (l < r) {
+            int m = l + ((r - l) >> 1);
+            if (nums[m] > nums[r]) {
+                l = m + 1;
+            } else if (nums[m] < nums[r]) {
+                r = m;
+            } else {
+                --r;
+            }
         }
-        return nums[left];
+        return nums[l];
     }
 }

solution/0100-0199/0154.Find Minimum in Rotated Sorted Array II/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        l, r = 0, len(nums) - 1
+        while l < r:
+            m = l + ((r - l) >> 1)
+            if nums[m] > nums[r]:
+                l = m + 1
+            elif nums[m] < nums[r]:
+                r = m
+            else:
+                r -= 1
+        return nums[l]