LeetCode-Combination Sum III-解题报告

最新推荐文章于 2024-07-04 21:39:57 发布

dinglin0xff

最新推荐文章于 2024-07-04 21:39:57 发布

阅读量342

点赞数

分类专栏： leetcode 文章标签： C++ leetcode

本文链接：https://blog.csdn.net/dd523762588/article/details/46688527

版权

leetcode 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

原题链接https://leetcode.com/problems/combination-sum-iii/

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.

Ensure that numbers within the set are sorted in ascending order.

Example 1:

Input: k = 3, n = 7

Output:

[[1,2,4]]

Example 2:

Input: k = 3, n = 9

Output:

[[1,2,6], [1,3,5], [2,3,4]]

解题思路：使用dfs，从1开始每隔后面符合条件的数字都需要比前一个数字大。当剩余值除以剩下的个数的平均值比下一个小则返回，并且平均值不能大于9.

<span style="font-size:14px;">class Solution {
public:
	vector<int>tmp;
	vector<vector<int> >ans;
	int k;
	vector<vector<int> > combinationSum3(int k, int n) {
		tmp.resize(k);
		this->k = k;
		dfs(1, n, 1);
		return ans;
	}
	void dfs(int s, int n, int deep)
	{
		if (deep == k)
		{
			if (n > tmp[k - 2] && n <= 9)
			{
				tmp[k-1] = n;
				ans.push_back(tmp);
			}
			return;
		}
		for (int i = s; i <= 9; ++i)
		{
			if ((n - i) / (k - deep) >= i + 1 && (n - i) / (k - deep) <= 9)
			{
				tmp[deep - 1] = i;
				dfs(i + 1, n - i, deep + 1);
			}
		}
	}
};</span>