Leetcode 33. Search in Rotated Sorted Array (Hard) (java)

Leetcode 33. Search in Rotated Sorted Array (Hard) (java) 

Tag: Array, Binary Search 

Difficulty: Hard

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