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

修复二分法 Rust 示例错误

Browse Source
This commit is contained in:
alain
2024-03-25 16:24:29 +08:00
parent 253bddcf37
commit 10af2bdde4
1 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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