forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
71 lines (60 loc) · 1.84 KB
/
Main.java
File metadata and controls
71 lines (60 loc) · 1.84 KB
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
64
65
66
67
68
69
70
71
import java.util.*;
public class Main {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (nums[left] < nums[mid]) {
if (target >= nums[left] && target < nums[mid]) {
right = mid - 1;
} else if (target == nums[mid]) {
return mid;
} else {
left = mid + 1;
}
} else if (nums[left] == nums[mid]) {
if (target == nums[mid]) {
return mid;
} else {
left++;
}
}
else {
if (target > nums[mid] && target <= nums[right]) {
left = mid + 1;
} else if (target == nums[mid]) {
return mid;
} else {
right = mid - 1;
}
}
}
return -1;
}
// [3,1], 1
public int search2(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if (target == nums[mid]) {
return mid;
}
if (nums[left] <= nums[mid]) {
if (target >= nums[left] && target < nums[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
} else {
if (target > nums[mid] && target <= nums[right]) {
left = mid + 1;
} else {
right = mid - 1;
}
}
}
return -1;
}
public static void main(String[] args) {
}
}