Search in the rotated array Leetcode #33 题解[Python]

题目描述

---

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]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

Your algorithm’s runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

题目大意很简单, 给出一个已经预先按升序排列的数列, 随后对其进行类似于下图的调换:

之后要求给出一个在$O(n)$时间复杂度内求解的算法.

解题思路

---

我开始的思路也是很简单, 理论上也确实是$O(n)$的复杂度. 然而, 事情就怕然而, 其实现过于复杂.
我的思路是, 虽然数组可能进行了旋转, 但总是有大小规律的. 我直接同二分查找的思路一样, 维护left, mid, high这几个变量, 只不过每当需要比较target与nums[mid]时, 综合考虑nums[mid], nums[left], nums[right]的大小, 以此来分辨target究竟落在了怎样的数组区间里. 但这样把思路写出来, 代码的圈复杂度一下变得奇高, 如下所示.

后来注意到评论区高人的代码, 顿时豁然开朗. 既然寻求在一次”类二分查找”中解决问题难度偏大, 为什么不把问题拆解成两部分来解决呢?

1. 首先用第一次二分查找找出旋转轴的pivot位置, 比如本文中Fig 1的3即是旋转的pivot
2. 找到了pivot后, 就可以根据target的值进行标准的二分查找

代码实现

---

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        length=len(nums)
        lo = 0
        hi = length - 1
        while lo < hi:
            mid = int((lo + hi) / 2)
            if nums[mid] > nums[hi]:
                lo = mid + 1
            else:
                hi = mid

        if length==0:
            pass
        elif target > nums[length-1]:
            lo = 0
            hi = hi - 1
        else:
            hi = length - 1

        while lo <= hi:
            mid = int((lo + hi) / 2)
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                hi = mid - 1
            else:
                lo = mid + 1

        return -1