Solution.java

package leetcode.searchInRotatedSortedArray;

class Solution {
    public int search(int[] nums, int target) {
        int low = 0;
        int high = nums.length - 1;

        while(low <= high){
            int mid = low + (high - low) / 2;

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

            if(nums[low] <= nums[mid]) {
                if(nums[low] <= target && nums[mid] > target ){
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            } else {
                if(nums[mid] < target && nums[high] >= target){
                    low = mid + 1;
                } else {
                    high = mid - 1;
                }
            }
        }

        return -1;

    }

    public static void main(String[] args) {
        Solution solution = new Solution();

        int result = solution.search(new int[]{3,5,1}, 3);

        System.out.println(" Result: " + result);
    }
}