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.

public class Solution {    public int search(int[] nums, int target) {        int start = 0, end = nums.length - 1;        while (start <= end) {            int mid = start + (end - start) / 2;            if (nums[mid] == target) {                return mid;            }            if (nums[start] <= nums[mid]) {                if (target >= nums[start] && target < nums[mid]) {                    end = mid - 1;                } else {                    start = mid + 1;                }            }            if (nums[end] >= nums[mid]) {                if (target <= nums[end] && target > nums[mid]) {                    start = mid + 1;                } else {                    end = mid - 1;                }            }        }        return -1;    }}