NC48 在旋转过的有序数组中寻找目标值

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型一维数组 
     * @param target int整型 
     * @return int整型
     */
    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[mid]){
                if(target < nums[mid]) right = mid -1;
                else left = mid + 1;
            }else{
                if(target >nums[mid] ) left = mid + 1;
                else right = mid - 1;
            }
        }
        return -1;
    }
}