Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public int climbStairs(int n) { n = n+1; double sqrt5 = Math.sqrt(5); double ret = (1/sqrt5)*(Math.pow((1+sqrt5)/2, n)-Math.pow((1-sqrt5)/2, n)); return (int)ret; }

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.