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.

注意邊界的判斷，比如[1,3] target = 3,[1,2],target = 0，[1] target = 1這種。

class Solution {
    public int search(int[] nums, int target) {
        if(nums.length==0) return -1;
        int s = 0;
        int e = nums.length-1;
        int m;
        while(s<=e){
            m = (s+e)/2;
            System.out.println("nums[m]="+nums[m]+";m="+m);
            if(nums[m]==target) {
                return m;
            }
                //System.out.println("m="+m+";s="+s+";e="+e);
                if(nums[s]<=nums[m]){//s到m之間正常有序，如果target在此區間內，正常二分,等號的目的是考慮[3,1]target=1的情況
                    if(nums[m]>target&&target>=nums[s]){
                        e = m-1;
                    }else{
                        s = m+1;
                    }                       
                }else{//m到e之間正常有序，如果target在此區間內，正常二分
                    if(nums[e]>=target&&target>nums[m]){
                        s = m+1;
                    }else{
                        e = m-1;
                    }    

                        
            }            
        }
        
        return -1;
    }
}