From 22537818597363b81ef74ee8b13d2b78f4896341 Mon Sep 17 00:00:00 2001
From: changcv2021 <104847847+changcv2021@users.noreply.github.com>
Date: Thu, 22 Sep 2022 11:49:20 +0800
Subject: [PATCH 1/2] =?UTF-8?q?Update=200704.=E4=BA=8C=E5=88=86=E6=9F=A5?=
 =?UTF-8?q?=E6=89=BE.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0704.二分查找.md | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md
index 7160a884..3a44bb57 100644
--- a/problems/0704.二分查找.md
+++ b/problems/0704.二分查找.md
@@ -225,14 +225,13 @@ class Solution:
     def search(self, nums: List[int], target: int) -> int:
         if nums is None or len(nums)==0:
             return -1
-        l=0
-        r=len(nums)-1
-        while (l<=r):
-            m = round(l+(r-l)/2)
+        l,r=0,len(nums)
+        while (l<r):
+            m = round(l+(r-l)//2)
             if nums[m] == target:
                 return m     
             elif nums[m] > target:
-                r=m-1
+                r=m
             else:
                 l=m+1
         return -1 

From 4eaca5f06f6603bede999ee95cbcc0eab26b1b94 Mon Sep 17 00:00:00 2001
From: changcv2021 <104847847+changcv2021@users.noreply.github.com>
Date: Thu, 22 Sep 2022 11:51:56 +0800
Subject: [PATCH 2/2] =?UTF-8?q?Update=200704.=E4=BA=8C=E5=88=86=E6=9F=A5?=
 =?UTF-8?q?=E6=89=BE.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0704.二分查找.md | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md
index 3a44bb57..d1389549 100644
--- a/problems/0704.二分查找.md
+++ b/problems/0704.二分查找.md
@@ -225,15 +225,15 @@ class Solution:
     def search(self, nums: List[int], target: int) -> int:
         if nums is None or len(nums)==0:
             return -1
-        l,r=0,len(nums)
-        while (l<r):
-            m = round(l+(r-l)//2)
-            if nums[m] == target:
-                return m     
-            elif nums[m] > target:
-                r=m
+        left,right=0,len(nums)
+        while (left<right):
+            middle = round(left+(right-left)//2)
+            if nums[middle] == target:
+                return middle     
+            elif nums[middle] > target:
+                right=middle
             else:
-                l=m+1
+                left=middle+1
         return -1 
 ```