【LeetCode】Combination Sum II

最新推荐文章于 2019-05-07 10:37:18 发布
最新推荐文章于 2019-05-07 10:37:18 发布
阅读量265 收藏
点赞数
CC 4.0 BY-SA版权
分类专栏： leetcode 文章标签： leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/gfgdsg/article/details/41250641
本文详细探讨了如何使用C++编程语言实现组合算法，并通过具体实例展示了算法的实现过程，包括DFS（深度优先搜索）的使用、数组排序、结果集的收集等关键步骤。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

class Solution {
public:
   void DFSII(vector<vector<int>> &result, vector<int> &intermediate, int gap, int start, vector<int> &nums)
{
	if (gap == 0)
	{	result.push_back(intermediate);
	return;
	}
	int previous = -1;
	for (size_t i = start; i < nums.size(); i++)
	{
		if (nums[i] == previous)
			continue;
		if (gap < nums[i])
			return;
		 previous=nums[i];
		intermediate.push_back(nums[i]);
		DFSII(result, intermediate, gap - nums[i], i + 1, nums);
		intermediate.pop_back();
	}
}
vector<vector<int> > combinationSum2(vector<int> &nums, int target)
{
	sort(nums.begin(), nums.end());
	vector<vector<int>> result;
	vector<int> intermediate;
	DFSII(result, intermediate, target, 0, nums);
	return result;
}
};

LeetCode Combination Sum II
多看多听多总结
01-17 451
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the combina
leetcode Combination Sum II题解
leo_weile的博客
05-10 340
题目描述： Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations incandidateswhere the candidate numbers sums totarget. Each number incandida...
Leetcode Combination Sum II
靖空间
01-28 2799
标准递归回溯法可以搞定，防止重复，使用set容器。
leetcode Combination Sum II
u013626088的专栏
11-16 370
Combination Sum II 原题地址： https://oj.leetcode.com/problems/combination-sum-ii/ Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the
LeetCode 113 Combination Sum II
10-31 786
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the combinati
Leetcode 40. Combination Sum II
SnailTyan
10-16 403
文章作者：Tyan 博客：noahsnail.com &nbsp;|&nbsp; 优快云 &nbsp;|&nbsp; 简书 1. Description 2. Solution Version 1 class Solution { public: vector&lt;vector&lt;int&gt;&gt; combinationSum2(vector&lt;int&gt;&am...
LeetCode Combination Sum
yuanyuanxingxing的专栏
05-07 205
题目 https://leetcode.com/problems/combination-sum/ Given asetof candidate numbers (candidates)(without duplicates)and a target number (target), find all unique combinations incandidateswhere th...
【LeetCode】Add Binary
gfgdsg的专栏
03-04 551
class Solution { public: string addBinary(string a, string b) { int aindex = a.size() - 1; int bindex = b.size() - 1; string c; int flag = 0,num; while (aindex>=0 && bindex>=0) { nu
【LeetCode】Scramble String
gfgdsg的专栏
12-27 476
class Solution { public: bool isScramble(string s1, string s2) { const int N = s1.size(); if (N != s2.size()) return false; bool f[N + 1][N][N]; fill_n(&f[0][0][0], (N + 1)*N*N, false
【LeetCode】Search in Rotated Sorted Array II
gfgdsg的专栏
01-08 434
class Solution { public: bool search(int A[], int n, int target) { int start = 0, end = n; while (start != end) { int mid = (start + end) / 2; if (A[mid] == target) return
【LeetCode】Linked List Cycle II
gfgdsg的专栏
03-05 426
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *de
【LeetCode】Partition List
gfgdsg的专栏
03-04 418
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *pa
【LeetCode】Set Matrix Zeroes
gfgdsg的专栏
12-27 389
class Solution { public: void setZeroes(vector > &matrix) { bool x[1000] = { false }; bool y[1000] = {false}; int i, j; for (i = 0; i < matrix.size(); i++) { for (j = 0; j < matrix[0
【LeetCode】Binary Tree Level Order Traversal II
gfgdsg的专栏
11-13 388
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
【LeetCode】Unique Binary Search Trees II
gfgdsg的专栏
11-14 386
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
【LeetCode】Flatten Binary Tree to Linked List
gfgdsg的专栏
03-05 377
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
【LeetCode】Longest Substring Without Repeating Characters
gfgdsg的专栏
12-10 364
class Solution { public: int lengthOfLongestSubstring(string s) { const int MAX=256; int last[MAX]; fill(last,last+MAX,-1); int start=0; int max_len=0; for(int i=0;i<s.size();i++) {
【LeetCode】Pascal’s Triangle
gfgdsg的专栏
12-02 363
class Solution { public: vector > generate(int numRows) { vector> result; vectorret; int i, j; for (i = 0; i < numRows; i++) { if (i == 0) { ret.push_back(1); result.push
【LeetCode】Triangle
gfgdsg的专栏
12-01 359
class Solution { public: int minimumTotal(vector > &triangle) { if (triangle.size() == 0) return 0; vector f(triangle[triangle.size() - 1].size()); f[0] = triangle[0][0]; for (int i =
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值