leetcode/src/bin/search-in-rotated-sorted-array-ii.rs at main · bestgopher/leetcode · GitHub

Name: leetcode/src/bin/search-in-rotated-sorted-array-ii.rs at main · bestgopher/leetcode · GitHub
Rating: 4.8 (9382 reviews)
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
#![allow(dead_code, unused, unused_variables)]

fnmain(){
assert_eq!(true,Solution::search(vec![2,5,6,0,0,1,2],0));
assert_eq!(false,Solution::search(vec![2,5,6,0,0,1,2],3));
assert_eq!(
true,
Solution::search(
 vec![1,1,1,1,1,1,1,1,1,13,1,1,1,1,1,1,1,1,1,1,1,1],
13
)
);
assert_eq!(
true,
Solution::search(
 vec![1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1],
2
)
);
assert_eq!(true,Solution::search(vec![1,0,1,1,1],0));
assert_eq!(false,Solution::search(vec![1],0));
assert_eq!(true,Solution::search(vec![1],1));
}

structSolution;

implSolution{
pubfnsearch(nums:Vec<i32>,target:i32) -> bool{
let(mut start,mut end) = (0, nums.len() - 1);

while start <= end {
let mid = (start + end) / 2;
if nums[mid] == target {
returntrue;
}

if start == 0 && end == 0{
returnfalse;
}

if nums[start] == nums[mid] && nums[mid] == nums[end]{
 start += 1;
 end -= 1;
}elseif nums[start] <= nums[mid]{
if nums[start] <= target && nums[mid] > target {
 end = mid - 1;
}else{
 start = mid + 1;
}
}else{
if nums[mid] < target && target <= nums[nums.len() - 1]{
 start = mid + 1;
}else{
 end = mid - 1;
}
}
}

false
}
}