LeetCode-77.Combinations

https://leetcode.com/problems/combinations/

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 IList<IList<int>> Combine(int n, int k) 
    {
        IList<IList<int>> res = new List<IList<int>>();
        IList<int> list = new List<int>();
        Func(res, list,n, k,1);
        return res;
    }
    
    private void Func(IList<IList<int>> res, IList<int> list,int n, int k,int start)
    {
        if (k == 0)
        {
            res.Add(new List<int>(list));
            return;
        }

        for (int i = start; i <= n; i++)
        {
            list.Add(i);
            Func(res, list, n, k - 1,i+1);
            list.Remove(i); 
        }
    }
}