xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-11 03:10:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

idiomatic rust (#1485)

Browse Source 
* idomatic rust

* More idiomatic rust

* make rust code more idiomatic

* update
This commit is contained in:
rongyi
2024-08-23 02:33:47 +08:00
committed by GitHub
parent 6b2c38cae4
commit 8a6ce26f6a
4 changed files with 19 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/rust/chapter_backtracking/subset_sum_i_naive.rs
+5 -5
View File
@@ -6,7 +6,7 @@
/* 回溯算法：子集和 I */
fn backtrack(
mut state: Vec<i32>,
state: &mut Vec<i32>,
target: i32,
total: i32,
choices: &[i32],
@@ -14,7 +14,7 @@ fn backtrack(
) {
// 子集和等于 target 时，记录解
if total == target {
res.push(state);
res.push(state.clone());
return;
}
// 遍历所有选择
@@ -26,7 +26,7 @@ fn backtrack(
// 尝试：做出选择，更新元素和 total
state.push(choices[i]);
// 进行下一轮选择
backtrack(state.clone(), target, total + choices[i], choices, res);
backtrack(state, target, total + choices[i], choices, res);
// 回退：撤销选择，恢复到之前的状态
state.pop();
}
@@ -34,10 +34,10 @@ fn backtrack(
/* 求解子集和 I（包含重复子集） */
fn subset_sum_i_naive(nums: &[i32], target: i32) -> Vec<Vec<i32>> {
let state = Vec::new(); // 状态（子集）
let mut state = Vec::new(); // 状态（子集）
let total = 0; // 子集和
let mut res = Vec::new(); // 结果列表（子集列表）
backtrack(state, target, total, nums, &mut res);
backtrack(&mut state, target, total, nums, &mut res);
res
}