计算分配糖果的不同方式

/*
 * LeetCode 1692: Ways to Distribute Candies
 * Using Java Streams for a concise approach.
 * The approach will be similar to the DP solution but in a more functional style.
 */

import java.util.stream.IntStream;

public class SolutionStream {
    private static final int MOD = 1000000007;

    public int waysToDistributeCandies(int n, int k) {
        if (k > n) return 0;
        long[][] dp = new long[k + 1][n + 1];
        dp[0][0] = 1;
        IntStream.rangeClosed(1, k).forEach(i -> {
            IntStream.rangeClosed(i, n).forEach(j -> {
                dp[i][j] = (dp[i - 1][j - 1] + dp[i][j - i]) % MOD;
            });
        });
        return (int) dp[k][n];
    }

    public static void main(String[] args) {
        SolutionStream solution = new SolutionStream();
        System.out.println(solution.waysToDistributeCandies(5, 3)); // Output example
    }
}