摘要:
class Solution { public: vector<vector<string>> res; vector<string> path; bool is(string s, int start, int end) { for (int i = start, j = end; i < j; 阅读全文
posted @ 2022-09-04 15:00
hjy94wo
阅读(17)
评论(0)
推荐(0)
摘要:
class Solution { public: vector<vector<int>> res; vector<int> path; int sum = 0; void dfs(int start, int k, int n) { if (path.size() > k || sum > n) r 阅读全文
posted @ 2022-09-04 14:34
hjy94wo
阅读(14)
评论(0)
推荐(0)
摘要:
class Solution { public: vector<vector<int>> res; vector<int> path; int sum; void dfs(int start, vector<int>& candidates, int target) { if (sum > targ 阅读全文
posted @ 2022-09-04 09:18
hjy94wo
阅读(28)
评论(0)
推荐(0)
摘要:
class Solution { public: vector<vector<int>> res; vector<int> path; int sum = 0; void dfs(int start, vector<int>& candidates, int target) { if (sum > 阅读全文
posted @ 2022-09-04 08:51
hjy94wo
阅读(16)
评论(0)
推荐(0)