package LeetCode;
public class Test {
      public static void main(String[] args) {
            int[] nums1 = {4,5,6,7,0,1,2};
            int target1 = 3;
            System.out.println(search(nums1, target1));
            
            int[] nums2 = {5,1,3};
            int target2 = 1;
            System.out.println(search(nums2, target2));
            
            
      }
    public static int search(int[] nums, int target) {
       int l = 0;
       int r = nums.length-1;
       
       while (l <= r) {
             
             int mid = (l+r)/2;
             
             if (nums[l] == target) return l;
             if (nums[r] == target) return r;
             if (nums[mid] == target) return mid;
             
             if (nums[l] < nums[mid]) {
                   if (target > nums[l] && target < nums[mid]) {
                         r = mid-1;
                   } else {
                         l = mid+1;
                   }
             } else {
                   if (target > nums[mid] && target < nums[r]) {
                         l = mid+1;
                   } else {
                         r = mid-1;
                   }
             }
       }
       
       return -1;
    }
}