LeetCode Search in Rotated Sorted Array

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) {
        int i = 0, j = n - 1, m = (i + j) / 2;
        while(i <= j) {
            if(A[i] <= A[j]) {
                if(target == A[m]) return m;
                else if(target > A[m]) i = m + 1;
                else j = m - 1;
            }
            else {
                if(A[m] > A[j]) {
                    if(target == A[m]) return m;
                    if(target >= A[i] && target < A[m]) j = m - 1;
                    else i = m + 1;
                }
                else {
                    if(target == A[m]) return m;
                    if(target > A[m] && target <= A[j]) i = m + 1;
                    else j = m - 1;
                }
            }
            m = (i + j) / 2;
        }
        return -1;
    }
};

思路：

解法时间复杂度O(logn)。代码并不简洁。是一点点推出来的直观解法。

有人提出了一种更简洁的写法，先用类似折半法找出最小数的索引，这样while循环里的部分会简单很多。

Discuss里居然有人从头到尾扫了一遍。。

附：更简洁的写法（留坑）