12345 题目：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?Note: Given n will be a positive integer. 1234567891011121314151617 public class { public int climbStairs(int n){ if(n == 1) return 1; if(n == 2); return 2; int onestep = 2; int two = 1; //离终点2steps int result = 0; for(int i = 2 ; i < n ; i++){ result = onestep + twostep; twostep = onestep; onestep = result; } return result; }} 赞微海报分享
近期评论