algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2331 from fwqaaq/patch-1

Browse Source 
Update 0704.二分查找.md about Rust
This commit is contained in:
程序员Carl
2023-11-09 10:11:56 +08:00
committed by GitHub
parent 8adede9b74 040f94472b
commit 4dac467907
1 changed files with 21 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
problems/0704.二分查找.md
View File

@ -481,41 +481,39 @@ func search(nums: [Int], target: Int) -> Int {
### **Rust:**
```rust
# （版本一）左闭右闭区间
（版本一）左闭右开区间
```rust
use std::cmp::Ordering;
impl Solution {
pub fn search(nums: Vec<i32>, target: i32) -> i32 {
let mut left:usize = 0;
let mut right:usize = nums.len() - 1;
while left as i32 <= right as i32{
let mid = (left + right) / 2;
if nums[mid] < target {
left = mid + 1;
} else if nums[mid] > target {
right = mid - 1;
} else {
return mid as i32;
let (mut left, mut right) = (0, nums.len());
while left < right {
let mid = (right + left) / 2;
match nums[mid].cmp(&target) {
Ordering::Less => left = mid + 1,
Ordering::Greater => right = mid,
Ordering::Equal => return mid as i32,
}
}
-1
}
}
```
# （版本二）左闭右开区间
//（版本二）左闭右闭区间
```rust
use std::cmp::Ordering;
impl Solution {
pub fn search(nums: Vec<i32>, target: i32) -> i32 {
let mut left:usize = 0;
let mut right:usize = nums.len();
while left < right {
let mid = (left + right) / 2;
if nums[mid] < target {
left = mid + 1;
} else if nums[mid] > target {
right = mid;
} else {
return mid as i32;
let (mut left, mut right) = (0, nums.len());
while left <= right {
let mid = (right + left) / 2;
match nums[mid].cmp(&target) {
Ordering::Less => left = mid + 1,
Ordering::Greater => right = mid - 1,
Ordering::Equal => return mid as i32,
}
}
-1