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

update 0077.组合.md about rust 命名以及其它方面的优化

Browse Source
This commit is contained in:
fw_qaq
2022-12-17 00:17:30 +08:00
committed by GitHub
parent 50c518515e
commit bfced8f385
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
problems/0077.组合.md
View File

@ -514,21 +514,21 @@ function combine(n: number, k: number): number[][] {
```Rust ```Rust
impl Solution { impl Solution {
fn backtracking(result: &mut Vec<Vec<i32>>, path: &mut Vec<i32>, n: i32, k: i32, startIndex: i32) { fn backtracking(result: &mut Vec<Vec<i32>>, path: &mut Vec<i32>, n: i32, k: i32, start_index: i32) {
let len= path.len() as i32; let len= path.len() as i32;
if len == k{ if len == k{
result.push(path.to_vec()); result.push(path.to_vec());
return; return;
} }
for i in startIndex..= n { for i in start_index..= n {
path.push(i); path.push(i);
Self::backtracking(result, path, n, k, i+1); Self::backtracking(result, path, n, k, i+1);
path.pop(); path.pop();
} }
} }
pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> { pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
let mut result: Vec<Vec<i32>> = Vec::new(); let mut result = vec![];
let mut path: Vec<i32> = Vec::new(); let mut path = vec![];
Self::backtracking(&mut result, &mut path, n, k, 1); Self::backtracking(&mut result, &mut path, n, k, 1);
result result
} }
@ -538,22 +538,22 @@ impl Solution {
剪枝 剪枝
```Rust ```Rust
impl Solution { impl Solution {
fn backtracking(result: &mut Vec<Vec<i32>>, path: &mut Vec<i32>, n: i32, k: i32, startIndex: i32) { fn backtracking(result: &mut Vec<Vec<i32>>, path: &mut Vec<i32>, n: i32, k: i32, start_index: i32) {
let len= path.len() as i32; let len= path.len() as i32;
if len == k{ if len == k{
result.push(path.to_vec()); result.push(path.to_vec());
return; return;
} }
// 此处剪枝 // 此处剪枝
for i in startIndex..= n - (k - len) + 1 { for i in start_index..= n - (k - len) + 1 {
path.push(i); path.push(i);
Self::backtracking(result, path, n, k, i+1); Self::backtracking(result, path, n, k, i+1);
path.pop(); path.pop();
} }
} }
pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> { pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
let mut result: Vec<Vec<i32>> = Vec::new(); let mut result = vec![];
let mut path: Vec<i32> = Vec::new(); let mut path = vec![];
Self::backtracking(&mut result, &mut path, n, k, 1); Self::backtracking(&mut result, &mut path, n, k, 1);
result result
} }