leetcode SearchinRotatedSortedArray

public class SearchinRotatedSortedArray {
    /**
     * 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) {
        int left = 0;
        int right = nums.length-1;
        while (left < right) {
            int mid = (left + right) / 2;
            if (nums[mid] > nums[0]) {
                left = mid + 1;
            }
            else {
                right = mid;
            }
        }
        int min = left;

        if (target == nums[0]) return 0;


        if (min == 0 || target < nums[0]) {
            left = min;
            right = nums.length-1;

        }
        else  {
            left = 1;
            right = min-1;
        }
        System.out.println(left + " "+ right);
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] == target) return mid;
            else if (nums[mid] < target) {
                left = mid + 1;
            }
            else {
                right = mid - 1;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        search(new int[]{4,3,2,1,0}, 3);
    }

}