[leetcode] Find Minimum in Rotated Sorted Array @ Python
浏览数：21 /
时间：2015年06月08日
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
郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。
