leetcode 33. Search in Rotated Sorted Array [medium][java]

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**

Solution: binary search

class Solution {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        while(left <= right) {
            int mid = (left+right)/2;
            if(nums[mid] == target)
                return mid;
            if(nums[mid] < target) {
                // the left side is ordered
                if(nums[left] < nums[mid]) {
                    left = mid+1;
                // the right side is ordered
                } else {
                    if(nums[right] < target) {
                        right = mid-1;
                    } else {
                        left = mid+1;
                    }  
                }
            } else {
                //the right side is ordered
                if(nums[right] > nums[mid]) {
                    right = mid-1;
                } else {
                    if(nums[left] > target) {
                        left = mid+1;
                    } else {
                        right = mid-1;
                    }
                }
            }
      
        }
        return -1;
    }
}

Reference

1. https://www.cnblogs.com/springfor/p/3858140.html