github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Normalize mid calculate in case overflow

Browse Source
This commit is contained in:
rongyi 2024-05-14 18:34:22 +08:00
parent 063a41fa7f
commit 44ddba38a6
2 changed files with 2 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
codes/rust/chapter_divide_and_conquer/binary_search_recur.rs
View File

@ -10,7 +10,7 @@ fn dfs(nums: &[i32], target: i32, i: i32, j: i32) -> i32 {
if i > j { if i > j {
return -1; return -1;
} }
let m: i32 = (i + j) / 2; let m: i32 = i + (j - i) / 2;
if nums[m as usize] < target { if nums[m as usize] < target {
// 递归子问题 f(m+1, j) // 递归子问题 f(m+1, j)
return dfs(nums, target, m + 1, j); return dfs(nums, target, m + 1, j);

4
codes/rust/chapter_sorting/radix_sort.rs
View File

@ -35,9 +35,7 @@ fn counting_sort_digit(nums: &mut [i32], exp: i32) {
counter[d] -= 1; // 将 d 的数量减 1 counter[d] -= 1; // 将 d 的数量减 1
} }
// 使用结果覆盖原数组 nums // 使用结果覆盖原数组 nums
for i in 0..n { nums.copy_from_slice(&res);
nums[i] = res[i];
}
} }
/* 基数排序 */ /* 基数排序 */