【LeetCode】33. 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.

解题思路

由于是有序排序的旋转，所以，一般情况下，前半部分是升序，后半部分是降序的。
首先，判断target与第一个数字的关系，考虑：

• 如果比第一个数字小，那就从后往前找，直到找到或者遇到旋转点。
• 否则，就从前往后找，直到找到或者是遇到旋转点。

AC代码

class Solution {
public:
    int search(vector<int>& nums, int target) {
        if (nums.empty())
            return -1;

        if (target < nums[0]) {
            for (int i = nums.size() - 1; i > 0; --i) {
                if (target == nums[i])
                    return i;
                if (nums[i - 1] > nums[i])
                    return -1;
            }
        }
        else {
            for (int i = 0; i < nums.size(); ++i) {
                if (target == nums[i])
                    return i;
                if (i + 1 < nums.size() && nums[i + 1] < nums[i])
                    return -1;
            }
        }

        return -1;
    }
};