给定两个整数 n
和 k
,返回 1 ... n
中所有可能的 k
个数的组合。
示例 1:
输入: n = 4, k = 2 输出: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]
示例 2:
输入: n = 1, k = 1 输出: [[1]]
提示:
1 <= n <= 20
1 <= k <= n
-
public class Solution { IList<IList<int>> res = new List<IList<int>>(); public IList<IList<int>> Combine(int n, int k) { AAA(1,n,k,new List<int>()); return res; } public void AAA(int index,int n,int k,List<int> res2){ if(res2.Count == k){ res.Add(new List<int>(res2)); return; } else{ if(res2.Count + n - index +1 < k) return; res2.Add(index); AAA(index+1,n,k,res2); res2.Remove(res2[^1]); AAA(index+1,n,k,res2); } } }