递归和暴力求组合数

阅读 88

2022-03-12

private static long combine(int m, int n) { //递归调用
    if(n == 0) return 1;
    if(n == 1) return m;
    if(n > m/2) return combine(m, m - n);
    if(n > 1) return combine(m - 1, n) + combine(m - 1, n - 1);
    return -1;
} 
private static long combine(int a, int b) {
    long res = 1;
    for (int i = a,j = 1; j <= b; i--, j++) res = res * i / j;
}

精彩评论(0)

0 0 举报