problemscpp
A collection of my answers to algorithm problems in c++.
载入中...
搜索中...
未找到
leetcode::combination_sum::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数

static vector< vector< int > > combinationSum (vector< int > &candidates, int target)
 
static vector< vector< int > > recurse (vector< int > &candidates, int target, int index)
 

详细描述

在文件 leetcode.h2408 行定义.

成员函数说明

◆ combinationSum()

vector< vector< int > > leetcode::combination_sum::Solution::combinationSum ( vector< int > & candidates,
int target )
static

在文件 leetcode.cpp6462 行定义.

6462 {
6463 sort(candidates.begin(), candidates.end());
6464 return recurse(candidates, target, 0);
6465 }
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.cpp6467 行定义.

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);
6477 ans.push_back(vec);
6478 }
6479 }
6480 }
6481 return ans;
6482 }
vector< vector< int > > ans
int vec[100010]

引用了 recurse().

被这些函数引用 combinationSum() , 以及 recurse().


该类的文档由以下文件生成: