GitHub Viewer
package LeetCode;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
public class LeetCode77 {
//https://leetcode-cn.com/problems/combinations/description/
/// 时间复杂度: O(n^k)
/// 空间复杂度: O(k)
private ArrayList res;
public List combine(int n, int k) {
res = new ArrayList();
if(n