爬梯

 

我的答案：

var climbStairs = function(n) {

var mul = Math.floor(n/2)

var way = 0

if (n === 1){

way=1

} else {

for (var i = 0; i<=mul; i++) {

let sult = 1

for (var j=n-2*i+1; j<=n-i; j++){

sult *= j

}

var cul1 = 1

for(var k = 1; k<=i; k++) {

cul1 = cul1*k

}

sult = sult/cul1

way += sult

}

}

return way

};