LeetCode : 33. Search in Rotated Sorted Array

[congr]

https://leetcode.com/problems/search-in-rotated-sorted-array/

[congr]

Use binsearch which is slightly different.

[congr]

class Solution {
    public int search(int[] nums, int target) {
        if (nums.length == 0) return -1;
        int s = 0, e = nums.length-1;

        while(s <= e) {
            int m = (s+e) / 2;
            if (nums[m] == target) return m;

            if (nums[s] <= nums[m]) {
                if (nums[s] <= target && target <= nums[m]) e = m;
                else s = m+1;
            }

            else if (nums[m] <= nums[e]) {
                if (nums[m] <= target && target <= nums[e]) s = m;
                else e = m-1;
            }
        }

        return -1; // not found
    }
}

[congr]

related to #206, #422.

Similar questions;

153. Find Minimum in Rotated Sorted Array
154. Search in Rotated Sorted Array
155. Search in Rotated Sorted Array II