Commit 4524ae8

authored

docs: fix solution to lcof problem: No.11 (#3730)

1 parent 2ea718e commit 4524ae8Copy full SHA for 4524ae8

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -46,7 +46,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/lcof/%E9%9D%A2%E8%AF%95%E9`
`46`	`46`
`47`	`47`	- `numbers[mid] > numbers[r]`:中间元素一定不是最小值,因此 $l = mid + 1$;
`48`	`48`	- `numbers[mid] < numbers[r]`:中间元素可能是最小值,因此 $r = mid$;
`49`		-- `numbers[mid] == numbers[r]`:中间元素一定不是最小值,因此 $r = r - 1$。
	`49`	+- `numbers[mid] == numbers[r]`:无法确定最小值的位置,但可以简单地缩小搜索范围,因此 $r = r - 1$。
`50`	`50`
`51`	`51`	`循环结束时,指针 $l$ 和 $r$ 指向同一个元素,即为最小值。`
`52`	`52`

Comments

(0)