在Java中计算二项式系数的最快方法

public class BinomialCoefficient {
    public static int calculate(int n, int k) {
        int[][] dp = new int[n + 1][k + 1];

        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= Math.min(i, k); j++) {
                if (j == 0 || j == i) {
                    dp[i][j] = 1;
                } else {
                    dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];
                }
            }
        }

        return dp[n][k];
    }

    public static void main(String[] args) {
        int n = 5;
        int k = 2;
        int result = calculate(n, k);
        System.out.println("The binomial coefficient C(" + n + ", " + k + ") is: " + result);
    }
}