combination-sum.rs

#![allow(dead_code, unused, unused_variables)]

fnmain(){}

structSolution;

implSolution{
pubfncombination_sum(candidates:Vec<i32>,target:i32) -> Vec<Vec<i32>>{
letmut candidates = candidates;
 candidates.sort();
Self::calc(&candidates, target)
}

fncalc(candidates:&Vec<i32>,target:i32) -> Vec<Vec<i32>>{
letmut r = vec![];

for&i in candidates.iter(){
if i > target {
break;
}

letmut v = vec![];
if i == target {
 v.push(i);
 r.push(v);
}elseif i < target {
let x = Self::calc(&candidates, target - i);
formut m in x {
if !m.is_empty(){
if i >= *m.last().unwrap(){
// 递增排列，用于去重复
 m.push(i);
 r.push(m);
}
}
}
}
}
 r
}
}