Merge pull request #1656 from changcv2021/master

更新二分查找0704 python 左闭右开

problems/0704.二分查找.md

@@ -225,16 +225,15 @@ class Solution:
     def search(self, nums: List[int], target: int) -> int:
         if nums is None or len(nums)==0:
             return -1
-        l=0
+        left,right=0,len(nums)
-        r=len(nums)-1
+        while (left<right):
-        while (l<=r):
+            middle = round(left+(right-left)//2)
-            m = round(l+(r-l)/2)
+            if nums[middle] == target:
-            if nums[m] == target:
+                return middle     
-                return m     
+            elif nums[middle] > target:
-            elif nums[m] > target:
+                right=middle
-                r=m-1
             else:
-                l=m+1
+                left=middle+1
         return -1 
 ```