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

 public static int search(int[] nums, int target)
    {
        if(nums.length == 0|| nums == null ) return -1;
        int lo = 0;
        int high = nums.length - 1;
        while(lo < high)
        {
            int mid = (high + lo) / 2;
            if(target == nums[mid])  return mid;
            if(nums[lo] <= nums[mid])
            {
               if(target >= nums[lo] && target <= nums[mid])
               {
                   high = mid-1;
               }
               //如果target<nums[lo],则说明target在尾部
               else {
                   lo = mid + 1;
               }
            }
            else
            {
                if(target > nums[mid] && target <= nums[high])
                {
                    lo = mid + 1;
                }
                //如果target<nums[mid],则说明target一定处于首部
                else
                {
                    high = mid - 1;
                }
            }
        }
        return nums[lo] == target?lo:-1;
    }