From c0ef50b3df7c7119e86b41067c368f704946b1cc Mon Sep 17 00:00:00 2001
From: raidenkhan <96030339+raidenkhan@users.noreply.github.com>
Date: Thu, 21 Sep 2023 12:26:14 +0000
Subject: [PATCH] =?UTF-8?q?Update=2011.=20=E6=97=8B=E8=BD=AC=E6=95=B0?=
 =?UTF-8?q?=E7=BB=84=E7=9A=84=E6=9C=80=E5=B0=8F=E6=95=B0=E5=AD=97.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 notes/11. 旋转数组的最小数字.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/notes/11. 旋转数组的最小数字.md b/notes/11. 旋转数组的最小数字.md
index 020db3ff..055e3534 100644
--- a/notes/11. 旋转数组的最小数字.md	
+++ b/notes/11. 旋转数组的最小数字.md	
@@ -25,12 +25,12 @@
 
 ```java
 public int minNumberInRotateArray(int[] nums) {
-    if (nums.length == 0)
+    if (nums.length == 0)//check the base case and ensure the array is not empty
         return 0;
     int l = 0, h = nums.length - 1;
-    while (l < h) {
+    while (l < h) {//iterate whille the middle is less than the length of the arry
         int m = l + (h - l) / 2;
-        if (nums[m] <= nums[h])
+        if (nums[m] <= nums[h])//switch at point where array elements ge equal
             h = m;
         else
             l = m + 1;