#include <leetcode.h>
|
static vector< vector< int > > | combinationSum (vector< int > &candidates, int target) |
|
static vector< vector< int > > | recurse (vector< int > &candidates, int target, int index) |
|
◆ combinationSum()
vector< vector< int > > leetcode::combination_sum::Solution::combinationSum |
( |
vector< int > & |
candidates, |
|
|
int |
target |
|
) |
| |
|
static |
在文件 leetcode.cpp 第 6462 行定义.
6463 sort(candidates.begin(), candidates.end());
6464 return recurse(candidates, target, 0);
static vector< vector< int > > recurse(vector< int > &candidates, int target, int index)
引用了 recurse().
◆ recurse()
vector< vector< int > > leetcode::combination_sum::Solution::recurse |
( |
vector< int > & |
candidates, |
|
|
int |
target, |
|
|
int |
index |
|
) |
| |
|
static |
在文件 leetcode.cpp 第 6467 行定义.
6468 vector<vector<int>> ans;
6469 for(
int i = index; i < candidates.size(); i++) {
6470 auto &candidate = candidates[i];
6471 if(candidate == target) {
6472 ans.emplace_back(vector(1, candidate));
6473 }
else if(target - candidate >= 1) {
6474 auto res =
recurse(candidates, target - candidate, i);
6475 for(
auto &
vec: res) {
6476 vec.push_back(candidate);
引用了 recurse() , 以及 pat::a::a7_2::vec.
被这些函数引用 combinationSum() , 以及 recurse().
该类的文档由以下文件生成: