LeetCode : Search in Rotated Sorted Array [java]

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.

思路：分情况讨论：1. 完全在一个单调递增区间；2.跨两个区间，mid在左侧区间；3.跨两个区间，mid在右侧区间。

public 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[left] <= nums[right]) {  //完全属于左侧（或右侧）单调递增区间
				if (nums[mid] > target) {
					right = mid - 1;
				} else {
					left = mid + 1;
				}
			} else if (nums[left] <= nums[mid]) { // 整体跨越两段，mid在左侧单调递增区间
				if (target > nums[mid] || target < nums[left]) // 目标大于nums[mid]或者目标小于nums[left]，只能往右查找
					left = mid + 1;
				else
					right = mid - 1;
			} else { // 整体跨越两段，mid在右侧单调递增区间
				if (target < nums[mid] || target > nums[right])  //目标小于nums[mid]或者目标大于num[right]，只能往左查找
					right = mid - 1;
				else
					left = mid + 1;
			}
		}
		return -1; 
    }
}