Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
raidenkhan 2023-09-21 12:26:14 +00:00 committed by GitHub
parent b70121d377
commit c0ef50b3df
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
notes/11. 旋转数组的最小数字.md
View File

@ -25,12 +25,12 @@
```java ```java
public int minNumberInRotateArray(int[] nums) { 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; return 0;
int l = 0, h = nums.length - 1; 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; 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; h = m;
else else
l = m + 1; l = m + 1;