PIQ12: Find pivot in a sorted rotated array

11 篇文章 0 订阅

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:)'
# TODO!
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值