feat: update leetcode solutions: No.0033

Author: yanglbme

solution/0000-0099/0033.Search in Rotated Sorted Array/README.md

@@ -30,22 +30,57 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+二分查找。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        l, r = 0, len(nums) - 1
+        while l <= r:
+            mid = (l + r) >> 1
+            if nums[mid] == target:
+                return mid
+            if nums[mid] > target:
+                if nums[mid] >= nums[r] and target < nums[l]:
+                    l = mid + 1
+                else:
+                    r = mid - 1
+            else:
+                if nums[mid] <= nums[l] and target > nums[r]:
+                    r = mid - 1
+                else:
+                    l = mid + 1
+        return -1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int search(int[] nums, int target) {
+        int l = 0, r = nums.length - 1;
+        while (l <= r) {
+            int mid = (l + r) >>> 1;
+            if (nums[mid] == target) return mid;
+            if (nums[mid] > target) {
+                if (nums[mid] >= nums[r] && target < nums[l]) l = mid + 1;
+                else r = mid - 1;
+            } else {
+                if (nums[mid] <= nums[l] && target > nums[r]) r = mid - 1;
+                else l = mid + 1;
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **C++**

solution/0000-0099/0033.Search in Rotated Sorted Array/README_EN.md

@@ -39,13 +39,46 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        l, r = 0, len(nums) - 1
+        while l <= r:
+            mid = (l + r) >> 1
+            if nums[mid] == target:
+                return mid
+            if nums[mid] > target:
+                if nums[mid] >= nums[r] and target < nums[l]:
+                    l = mid + 1
+                else:
+                    r = mid - 1
+            else:
+                if nums[mid] <= nums[l] and target > nums[r]:
+                    r = mid - 1
+                else:
+                    l = mid + 1
+        return -1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int search(int[] nums, int target) {
+        int l = 0, r = nums.length - 1;
+        while (l <= r) {
+            int mid = (l + r) >>> 1;
+            if (nums[mid] == target) return mid;
+            if (nums[mid] > target) {
+                if (nums[mid] >= nums[r] && target < nums[l]) l = mid + 1;
+                else r = mid - 1;
+            } else {
+                if (nums[mid] <= nums[l] && target > nums[r]) r = mid - 1;
+                else l = mid + 1;
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **C++**

solution/0000-0099/0033.Search in Rotated Sorted Array/Solution.java

@@ -1,16 +1,16 @@
 class Solution {
-    public int search(int[] A, int target) {
-        if (A == null || A.length == 0) return -1;
-        int low = 0,high = A.length - 1;
-        while (low <= high) {
-            int mid = (low + high) >>> 1;
-            if (target < A[mid]) {
-                if (A[mid] >= A[high] && target < A[low]) low = mid + 1;
-                else high = mid - 1;
-            } else if (target > A[mid]) {
-                if (A[low] >= A[mid] && target > A[high]) high = mid - 1;
-                else low = mid + 1;
-            } else return mid;
+    public int search(int[] nums, int target) {
+        int l = 0, r = nums.length - 1;
+        while (l <= r) {
+            int mid = (l + r) >>> 1;
+            if (nums[mid] == target) return mid;
+            if (nums[mid] > target) {
+                if (nums[mid] >= nums[r] && target < nums[l]) l = mid + 1;
+                else r = mid - 1;
+            } else {
+                if (nums[mid] <= nums[l] && target > nums[r]) r = mid - 1;
+                else l = mid + 1;
+            }
         }
         return -1;
     }

solution/0000-0099/0033.Search in Rotated Sorted Array/Solution.py

@@ -0,0 +1,18 @@
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        l, r = 0, len(nums) - 1
+        while l <= r:
+            mid = (l + r) >> 1
+            if nums[mid] == target:
+                return mid
+            if nums[mid] > target:
+                if nums[mid] >= nums[r] and target < nums[l]:
+                    l = mid + 1
+                else:
+                    r = mid - 1
+            else:
+                if nums[mid] <= nums[l] and target > nums[r]:
+                    r = mid - 1
+                else:
+                    l = mid + 1
+        return -1