LeetCode | Search in Rotated Sorted Array

题目：

Suppose a sorted array 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.

思路：

类似二分查找法。从中间分开的两个子数组一定一个是升序，一个可能顺序不确定。那么我们判断待选数值是否在升序数组中，若在，在升序子数组中继续查找；否则，再另一数组中继续查找。

代码：

class Solution {
public:
    int search(int A[], int n, int target) {
        return searchInternal(A, 0, n-1, target);
    }
    
    int searchInternal(int A[], int begin, int end, int target){
        if(begin + 1 == end || begin == end){
            if(A[begin] == target){
                return begin;
            }
            else if(A[end] == target){
                return end;
            }
            else{
                return -1;
            }
        }
        
        int middle = begin + (end - begin) / 2;
        
        if(A[begin] < A[middle]){
            if(A[begin] <= target && target <= A[middle]){
                return searchInternal(A, begin, middle, target);
            }
            else{
                return searchInternal(A, middle, end, target);
            }
        }
        else if(A[middle] < A[end]){
            if(A[middle] <= target && target <= A[end]){
                return searchInternal(A, middle, end, target);
            }
            else{
                return searchInternal(A, begin, middle, target);
            }
        }
    }
};