We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1355e3b commit a766a7eCopy full SHA for a766a7e
solution/0700-0799/0704.Binary Search/Solution.rs
@@ -1,23 +1,19 @@
1
-use std::cmp::Ordering;
2
-
3
impl Solution {
4
pub fn search(nums: Vec<i32>, target: i32) -> i32 {
5
- let mut l = 0;
6
- let mut r = nums.len();
+ let mut l: usize = 0;
+ let mut r: usize = nums.len() - 1;
7
while l < r {
8
let mid = (l + r) >> 1;
9
- match nums[mid].cmp(&target) {
10
- Ordering::Less => {
11
- l = mid + 1;
12
- }
13
- Ordering::Greater => {
14
- r = mid;
15
16
- Ordering::Equal => {
17
- return mid as i32;
18
+ if nums[mid] >= target {
+ r = mid;
+ } else {
+ l = mid + 1;
19
}
20
21
- -1
+ if nums[l] == target {
+ l as i32
+ -1
+ }
22
23
0 commit comments