Combination Sum III LeetCode solution in JavaScript

1
/**
2
 * @param {number} k
3
 * @param {number} n
4
 * @return {number[][]}
5
 */
6
var combinationSum3 = function (k, n) {
7
  const ans = [];
8
  const st = [];
9

10
  function dfs(start, t) {
11
    if (t === 0 && st.length === k) {
12
      ans.push(Array.from(st));
13
      return;
14
    }
15
    for (let i = start; i <= 9 && st.length < k; i++) {
16
      if (i > t) break;
17
      st.push(i);
18
      dfs(i + 1, t - i);
19
      st.pop();
20
    }
21
  }
22

23
  dfs(1, n);
24

25
  return ans;
26
};