[LeetCode] 33. Search in Rotated Sorted Array

题目内容

https://leetcode-cn.com/problems/search-in-rotated-sorted-array/

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

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

( 例如，数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。

搜索一个给定的目标值，如果数组中存在这个目标值，则返回它的索引，否则返回 -1 。

你可以假设数组中不存在重复的元素。

你的算法时间复杂度必须是 O(log n) 级别。

---

题目思路

可以先用目标和第一个数字进行比较。如果目标大于第一个数字，则从左侧进行搜索。如果目标小于，则从右往左搜索。另一种就是直接用in函数来获得结果。

---

程序代码

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        if target not in nums:
            return -1
        if target>nums[0]:
            for i in range(len(nums)):
                if target==nums[i]:
                    return i
        else:
            for i in range(len(nums)-1,-1,-1):
                if target==nums[i]:
                    return i