problem1Solution.java

//Time Complexity : O(log n)
//Space Complexity : O(1)
//Search in a Rotated Sorted Array

public class problem1Solution {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        while(left<=right){
            int mid = left + (right - left)/2;
            if(nums[mid]== target) return mid;
            if(nums[left]<=nums[mid]) {
                if (target > nums[mid] || target < nums[left] )
                    left = mid + 1;
                else {
                    right = mid -1;
                }
            }
            else {
                if( target < nums[mid] || target > nums[right]){
                    right = mid - 1;
                }
                else {
                    left = mid + 1;
                }
            }
        }
        return -1;
    }
}