题目描述
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
public class Solution { public int climbStairs(int n) { int f = 1; int g = 0; while(n--!=0) { f += g; g = f - g; } return f; } }
very precise