Method backtrace

216-combination-sum-iii.rs:5–15

(n: i32, k: usize, start_index: i32, path: &mut Vec<i32>, ret: &mut Vec<Vec<i32>>, sum: i32)

// 回溯 = 递归 + 循环
impl Solution {
    pub fn backtrace(n: i32, k: usize, start_index: i32, path: &mut Vec<i32>, ret: &mut Vec<Vec<i32>>, sum: i32) {
        if path.len() == k && path.iter().sum::<i32>() == sum {
            ret.push(path.to_vec());
            return;
        }
        for i in start_index..=n {
            path.push(i);
            Self::backtrace(n, k, i+1, path, ret, sum);
            path.pop();
        }
    }

    pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
        let mut path = vec![];