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

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

Author: yanglbme

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

@@ -27,22 +27,48 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+二分查找。
+
+若 `nums[m] > nums[r]`，说明最小值在 m 的右边，否则说明最小值在 m 的左边（包括 m）。
+
 <!-- tabs:start -->
 
 ### **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
+            else:
+                r = m
+        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 {
+                r = m;
+            }
+        }
+        return nums[l];
+    }
+}
 ```
 
 ### **...**

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

@@ -39,13 +39,35 @@
 ### **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
+            else:
+                r = m
+        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 {
+                r = m;
+            }
+        }
+        return nums[l];
+    }
+}
 ```
 
 ### **...**

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

@@ -1,30 +1,14 @@
 class Solution {
     public int findMin(int[] nums) {
-        int n = nums.length;
-        if (n == 1) {
-            return nums[0];
-        }
-
-        int p = 0;
-        int q = n - 1;
-
-        int mid = p + ((q - p) >> 1);
-
-        while (p < q) {
-            if (nums[p] <= nums[q]) {
-                break;
-            }
-
-            if (nums[p] > nums[mid]) {
-                q = mid;
+        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 {
-                p = mid + 1;
+                r = m;
             }
-
-            mid = p + ((q - p) >> 1);
         }
-
-        return nums[p];
-
+        return nums[l];
     }
 }

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

@@ -1,30 +1,10 @@
 class Solution:
-    def findMin(self, nums):
-        """
-        :type nums: List[int]
-        :rtype: int
-        """
-        return min(nums)
-
-class Solution:
-    def findMin(self, nums):
-        """
-        :type nums: List[int]
-        :rtype: int
-        """
-        length=len(nums)
-        if length == 1:
-            return nums[0]
-        l=0
-        r=length-1
-        m=r//2
-        
-        while l<r:
-            if nums[l]<=nums[r]:
-                break
-            if nums[l]>nums[m]:
-                r=m
+    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
             else:
-                l=m+1
-            m=(l+r)//2
-        return nums[l]
+                r = m
+        return nums[l]