Commit 1b69f41

committed

🐱(binary-search): 153. 寻找旋转排序数组中的最小值

1 parent 15e8c78 commit 1b69f41Copy full SHA for 1b69f41

File tree

+22

-0

lines changed

+22

-0

lines changed

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -389,6 +389,28 @@ func searchMatrix(matrix [][]int, target int) bool {`
`389`	`389`	`}`
`390`	`390`	```
`391`	`391`
	`392`	`+## 153. 寻找旋转排序数组中的最小值`
	`393`	`+`
	`394`	`+[原题链接](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/)`
	`395`	`+`
	`396`	`+### 思路`
	`397`	`+`
	`398`	+```python
	`399`	`+class Solution:`
	`400`	`+ def findMin(self, nums: List[int]) -> int:`
	`401`	`+ left = 0`
	`402`	`+ right = len(nums) - 1`
	`403`	`+ while left < right:`
	`404`	`+ mid = (left + right) // 2`
	`405`	`+ if nums[mid] < nums[right]:`
	`406`	`+ # mid 可能是最小值`
	`407`	`+ right = mid`
	`408`	`+ else:`
	`409`	`+ # 最小值在 mid 右侧`
	`410`	`+ left = mid + 1`
	`411`	`+ return nums[left]`
	`412`	+```
	`413`	`+`
`392`	`414`	`## 162. 寻找峰值`
`393`	`415`
`394`	`416`	`[原题链接](https://leetcode-cn.com/problems/find-peak-element/)`

Comments

(0)