首页 > 代码库 > [leetcode] Find Minimum in Rotated Sorted Array @ Python
[leetcode] Find Minimum in Rotated Sorted Array @ Python
source: https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/
Suppose a sorted array 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.
Solution: Binary Search
Complexity: O(logN)
class Solution: # @param num, a list of integer # @return an integer def findMin(self, num): min = num[0] start, end = 0, len(num) - 1 while start <= end: mid = (start + end)/2 if num[mid] >= min: start = mid + 1 else: min = num[mid] end = mid return min
[leetcode] Find Minimum in Rotated Sorted Array @ Python
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。