k个正整数(可重复)之和为n，求所有可能路径

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;

public class Solution {
    public void dp(int k, int n, List<List<Integer>> result, Deque curr) {
        if (k > n || (k == 0 && n != 0)) {
            return;
        }
        if (k == 0 && n == 0) {
            result.add(new ArrayList<>(curr));
            return;
        }

        for (int i = 1; i <= n; i++) {
            curr.addLast(i);
            dp(k - 1, n - i, result, curr);
            curr.removeLast();

        }
    }

    public List<List<Integer>> so(int k, int n) {
        List<List<Integer>> result = new ArrayList<>();
        Deque<Integer> curr = new ArrayDeque<>();
        dp(k, n, result, curr);
        return result;
    }

    public static void main(String[] args) {
        Solution solution = new Solution();
        solution.so(3, 5);
    }

}