建造纸牌屋的方法数

/*
 * Leetcode Problem 2189: Number of Ways to Build House of Cards
 * 
 * Approach:
 * 1. Utilize Java Streams to calculate the number of ways to build a house of cards.
 * 2. Dynamic programming with streams to store and update results.
 * 3. Base case: There is one way to build a house of height 0.
 * 4. For each height from 1 to `n`, calculate the number of ways using the results of previous heights.
 */
import java.util.stream.IntStream;

public class Solution {
    public int houseOfCards(int n) {
        if (n == 0) return 1;
        if (n < 0) return 0;
        int[] dp = new int[n + 1];
        dp[0] = 1;
        IntStream.rangeClosed(1, n).forEach(i ->
            IntStream.rangeClosed(i, n).forEach(j ->
                dp[j] += dp[j - i]
            )
        );
        return dp[n];
    }
}