LeetCode_77 Combinations
来源:互联网 发布:单片机第二章答案详解 编辑:程序博客网 时间:2024/06/10 01:24
Link to original problem:
这里写链接内容
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],
]
Related problems:
39 Combination Sum: 这里写链接内容
46 Permutations: 这里写链接内容
这一题再将cur加入res的时机处理上与全遍历到结尾(一般是数组length处)再将cur加入res不同。而是即时检测,在进入数组length或者不满足继续放入物品的子函数之前,就放入res。避免了多次进入无效的子函数并多次将cur放入res。以下为代码:
public class Solution { public List<List<Integer>> combine(int n, int k) { List<List<Integer>> res = new ArrayList<List<Integer>>(); if(n <= 0 || k <= 0) return res; List<Integer> cur = new ArrayList<Integer>(); helper(res, cur, k, 0, n); return res; } private void helper(List<List<Integer>> res, List<Integer> cur, int remain, int start, int n){ if(remain == 0) return; for(int ii = start; ii < n; ii++){ cur.add(ii+1); if(remain == 1) res.add(new ArrayList<Integer>(cur)); helper(res, cur, remain-1, ii+1, n); cur.remove(cur.size()-1); } }}
0 0
- LeetCode_77 Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- Combinations
- combinations
- Combinations
- Combinations
- Combinations
- 使用python建立数据层模块,致敬廖雪峰老师
- LeetCode_60 Permutation Sequence
- CF618D - Hamiltonian Spanning Tree
- 【Leetcode】Binary Tree Level Order Traversal II
- 51Nod 1181 质数中的质数(质数筛选好题)(数论)
- LeetCode_77 Combinations
- LeetCode_78 Subsets
- LeetCode_79 Word Search
- Leetcode bit manipulation 总结
- BigBench: Toward An Industry-Standard Benchmark for Big Data Analytics
- 注意OD仅以16进制解析指令立即数
- Leetcode 322. Coin Change
- Codevs_P1732 Fibonacci数列 2(矩阵快速幂)
- Java 解析 XML