Categorygithub.com/imgoogege/leetcode-in-goAlgorithms0153.find-minimum-in-rotated-sorted-array
package
0.0.0-20190519142212-fe39b3200b40
Repository: https://github.com/imgoogege/leetcode-in-go.git
Documentation: pkg.go.dev

# README

153. Find Minimum in Rotated Sorted Array

题目

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array.

解题思路

见程序注释