【leetcode】77. Combinations【java】

最新推荐文章于 2022-07-01 23:00:14 发布

陈善亮-BUPT

最新推荐文章于 2022-07-01 23:00:14 发布

阅读量667

点赞数

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/cslbupt/article/details/53781662

版权

leetcode 专栏收录该内容

65 篇文章

订阅专栏

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],
]
public class Solution {
    public List<List<Integer>> combine(int n, int k) {
        //回溯法
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        List<Integer> tmp = new ArrayList<Integer>();
        backtrack(result, tmp, n, k, 1);
        return result;
    }
    private void backtrack(List<List<Integer>> result, List<Integer> tmp, int n, int k, int start){
        if (tmp.size() == k){
            result.add(new ArrayList(tmp));
            return;
        }
        for (int i = start; i <= n; i++){
            tmp.add(i);
            backtrack(result, tmp, n, k, i+1);
            tmp.remove(tmp.size() - 1);
        }
    }
}