Skip to content

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

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open

raidenkhan wants to merge 1 commit into CyC2018:master

from raidenkhan:patch-1

Open

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

Changes from all commits

Commits

Show all changes

Select commit

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

raidenkhan Sep 21, 2023

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

6 changes: 3 additions & 3 deletions notes/11. 旋转数组的最小数字.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -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;
Expand Down