Merge pull request #1 from janeyziqinglin/janeyziqinglin-patch-1

Update 0704.二分查找.md

problems/0704.二分查找.md

@@ -220,19 +220,21 @@ class Solution:
 
 （版本二）左闭右开区间
 
-```python
+```class Solution:
-class Solution:
     def search(self, nums: List[int], target: int) -> int:
-        left,right  =0, len(nums)
+        if nums is None or len(nums)==0:
-        while left < right:
+            return -1
-            mid = (left + right) // 2
+        l=0
-            if nums[mid] < target:
+        r=len(nums)-1
-                left = mid+1
+        while (l<=r):
-            elif nums[mid] > target:
+            m = round(l+(r-l)/2)
-                right = mid
+            if nums[m] == target:
+                return m     
+            elif nums[m] > target:
+                r=m-1
             else:
-                return mid
+                l=m+1
-        return -1
+        return -1 
 ```
 
 **Go：**