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

No need to use mut iter

Browse Source
This commit is contained in:
rongyi 2024-05-10 17:10:21 +08:00
parent 1f606d6852
commit 521be52e39
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
codes/rust/chapter_sorting/bucket_sort.rs
View File

@ -12,7 +12,7 @@ fn bucket_sort(nums: &mut [f64]) {
let k = nums.len() / 2; let k = nums.len() / 2;
let mut buckets = vec![vec![]; k]; let mut buckets = vec![vec![]; k];
// 1. 将数组元素分配到各个桶中 // 1. 将数组元素分配到各个桶中
for &mut num in &mut *nums { for &num in nums.iter() {
// 输入数据范围为 [0, 1)，使用 num * k 映射到索引范围 [0, k-1] // 输入数据范围为 [0, 1)，使用 num * k 映射到索引范围 [0, k-1]
let i = (num * k as f64) as usize; let i = (num * k as f64) as usize;
// 将 num 添加进桶 i // 将 num 添加进桶 i
@ -25,8 +25,8 @@ fn bucket_sort(nums: &mut [f64]) {
} }
// 3. 遍历桶合并结果 // 3. 遍历桶合并结果
let mut i = 0; let mut i = 0;
for bucket in &mut buckets { for bucket in buckets.iter() {
for &mut num in bucket { for &num in bucket.iter() {
nums[i] = num; nums[i] = num;
i += 1; i += 1;
} }