【Java】【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.

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

题解：

这道题是一道常见的二分查找法的变体题。

要解决这道题，需要明确rotated sorted array的特性，那么就是至少有一侧是排好序的（无论pivot在哪，自己画看看）。接下来就只需要按照这个特性继续写下去就好。以下就以伪代码方法来说明：

1. 如果target比nums[mid]值要小
2.       如果nums[mid]右边有序（nums[mid]<nums[high])
3.             那么target肯定不在右边（target比右边的都得小），在左边找
4.       如果A[mid]左边有序
5.             那么比较target和nums[low]，如果target比A[low]还要小，证明target不在这一区，去右边找；反之，左边找。
6. 如果target比nums[mid]值要大
7.      如果nums[mid]左边有序（nums[mid]>nums[low]）
8.            那么target肯定不在左边（target比左边的都得大），在右边找 
9.      如果nums[mid]右边有序
10.            那么比较target和nums[high]，如果target比A[high]还要大，证明target不在这一区，去左边找；反之，右边找。

以上实现代码如下所示：

public class SearchInRotatedSortedArray
{

    public static void main(String[] args)
    {
        /**
         * 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).
         * 
         * 
         */
        int[] nums = { 4, 5, 6, 7, 0, 1, 2 };
        /**
         * Example 1:
         * 
         * Input: nums = [4,5,6,7,0,1,2], target = 0
         * Output: 4
         */
        System.out.println(search(nums, 0));
        /**
         * Example 2:
         * 
         * Input: nums = [4,5,6,7,0,1,2], target = 3
         * Output: -1
         */
        System.out.println(search(nums, 3));
    }

    public static int search(int[] nums, int target)
    {
        if (nums == null || nums.length == 0)
            return -1;

        int low = 0;
        int high = nums.length - 1;

        while (low <= high)
        {
            int mid = (low + high) / 2;
            if (target < nums[mid])
            {
                if (nums[mid] < nums[high]) // right side is sorted
                {
                    high = mid - 1; // target must in left side
                }
                else if (target < nums[low]) // target<A[mid]&&target<A[low]==>means,target cannot be in [low,mid] since this side
                                             // is sorted
                {
                    low = mid + 1;
                }
                else
                {
                    high = mid - 1;
                }
            }
            else if (target > nums[mid])
            {
                if (nums[low] < nums[mid])// left side is sorted
                {
                    low = mid + 1; // target must in right side
                }
                else if (target > nums[high]) // right side is sorted. If target>A[high] means target is not in this side
                {
                    high = mid - 1;
                }
                else
                {
                    low = mid + 1;
                }
            }
            else
            {
                return mid;
            }
        }
        return -1;
    }

}