-
Notifications
You must be signed in to change notification settings - Fork 2
/
SearchInRotatedSortedArray.java
63 lines (57 loc) · 1.61 KB
/
SearchInRotatedSortedArray.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package Leetcode;
/**
* @author kalpak
*
* You are given an integer array nums sorted in ascending order (with distinct values), and an integer target.
*
* Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
*
* If target is found in the array return its index, otherwise, return -1.
*
* Example 1:
* Input: nums = [4,5,6,7,0,1,2], target = 0
* Output: 4
*
* Example 2:
* Input: nums = [4,5,6,7,0,1,2], target = 3
* Output: -1
*
* Example 3:
* Input: nums = [1], target = 0
* Output: -1
*
* Constraints:
*
* 1 <= nums.length <= 5000
* -10^4 <= nums[i] <= 10^4
* All values of nums are unique.
* nums is guaranteed to be rotated at some pivot.
* -10^4 <= target <= 10^4
*/
public class SearchInRotatedSortedArray {
public static 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(nums[left] <= target && target < nums[mid])
right = mid - 1;
else
left = mid + 1;
} else {
if(nums[mid] < target && target <= nums[right])
left = mid + 1;
else
right = mid - 1;
}
}
return -1;
}
public static void main(String[] args) {
int[] nums = new int[]{4,5,6,7,0,1,2};
System.out.println(search(nums, 2));
}
}