feat: update solutions to leetcode problem: No.0704

Author: yanglbme

solution/0700-0799/0704.Binary Search/README.md

@@ -51,7 +51,23 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int search(int[] nums, int target) {
+        int low = 0, high = nums.length - 1;
+        while (low <= high) {
+            int mid = low + ((high - low) >> 1);
+            if (nums[mid] == target) {
+                return mid;
+            }
+            if (nums[mid] < target) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0704.Binary Search/README_EN.md

@@ -51,13 +51,40 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def search(self, nums: List[int], target: int) -> int:
+        low, high = 0, len(nums) - 1
+        while low <= high:
+            mid = low + ((high - low) >> 1)
+            if nums[mid] == target:
+                return mid
+            if nums[mid] < target:
+                low = mid + 1
+            else:
+                high = mid - 1
+        return -1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int search(int[] nums, int target) {
+        int low = 0, high = nums.length - 1;
+        while (low <= high) {
+            int mid = low + ((high - low) >> 1);
+            if (nums[mid] == target) {
+                return mid;
+            }
+            if (nums[mid] < target) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return -1;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0704.Binary Search/Solution.java

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

solution/0700-0799/0704.Binary Search/Solution.py

@@ -1,22 +1,11 @@
-'''
-Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1.
-'''
-
-# Perfomance
-'''
-Runtime: 268 ms, faster than 84.25% of Python3 online submissions for Binary Search.
-Memory Usage: 14 MB, less than 100.00% of Python3 online submissions for Binary Search.
-'''
-
-
 class Solution:
     def search(self, nums: List[int], target: int) -> int:
         low, high = 0, len(nums) - 1
         while low <= high:
-            mid = low + (high - low) // 2
+            mid = low + ((high - low) >> 1)
             if nums[mid] == target:
                 return mid
-            elif nums[mid] < target:
+            if nums[mid] < target:
                 low = mid + 1
             else:
                 high = mid - 1