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 
 ```