climbing stairs

一开始觉得是简单的组合数学题，但是写完之后发现，首先组合数不是那么简单就能算好的，然后就是。。。。int对于up和down（分子和分母）太小了 囧啊 换成long好一点，还有错，然后再换成double，差不多了，但是有3个结果正好只差2，囧啊，改成float也不行，sigh

public class Solution {
    public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int sum = 0;
        for (int i = n /2 + n % 2; i <= n; ++i){
            int num1 = n - i;
            double up = 1, down = 1;
            for (int j = 1; j < n-i+1; ++j){
                down *= j;
                up *= i - j + 1;
            }
            sum += (int)(up / down);
        }
        return sum;
    }
}

最后发现不能用强制转换要用Math.round()函数 囧啊囧

public class Solution {
    public int climbStairs(int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int sum = 0;
        for (int i = n /2 + n % 2; i <= n; ++i){
            int num1 = n - i;
            double up = 1, down = 1;
            for (int j = 1; j < n-i+1; ++j){
                down *= j;
                up *= i - j + 1;
            }
            sum += Math.round(up / down);
        }
        return sum;
    }
}