Description: Given a sorted integer array which may have been rotated once, find the pivot index, i.e. index of the minimum element of the array.
Approach 1: Naive Solution
def pivot(nums):
"""
Time complexity: O(n)
Space complexity: O(1)
"""
if not nums:
return -1
num, index = nums[0], 0
for i in xrange(1, len(nums)):
if num > nums[i]:
num, index = nums[i], i
return index
if __name__ == "__main__":
nums1 = None
assert pivot(nums1) == -1
nums2 = []
assert pivot(nums2) == -1
nums3 = [1]
assert pivot(nums3) == 0
nums4 = [7, 8, 9, 1, 2, 3, 4, 5, 6]
assert pivot(nums4) == 3
nums5 = [1, 2, 3, 4, 5, 6, 7, 8, 9]
assert pivot(nums5) == 0
nums6 = [5, 5, 5, 0, 0, 1, 2, 5]
assert pivot(nums6) == 3
print 'All test cases passed:)'
Approach 2: Binary Search
# TODO!