Update 11. 旋转数组的最小数字.md

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;