Leetcode 77. Combinations (Medium) (cpp)

最新推荐文章于 2018-01-03 16:46:22 发布

Niko_Ke

最新推荐文章于 2018-01-03 16:46:22 发布

阅读量433

点赞数

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

本文链接：https://blog.csdn.net/niko_ke/article/details/52567046

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Backtracking

22 篇文章 0 订阅

订阅专栏

Leetcode 77. Combinations (Medium) (cpp)

Tag: Backtracking

Difficulty: Medium

/*

77. Combinations (Medium)

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

For example,
If n = 4 and k = 2, a solution is:

[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]

*/
class Solution {
public:
	vector<vector<int>> combine(int n, int k) {
		vector<vector<int>> res;
		int i = 0;
		vector<int> p(k, 0);
		while (i >= 0) {
			p[i]++;
			if (p[i] > n) --i;
			else if (i == k - 1) res.push_back(p);
			else {
				i++;
				p[i] = p[i - 1];
			}
		}
		return res;
	}
};