题目:
n
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n
思路:这道题目本质上是个动态规划的问题,虽然也可以用递归的方法做,但是时间复杂度太高,那么用动态规划就需要建立状态转移方程:X(i) = X(i-1) + X(i-2);
每次有两种选择,两种选择之后又是各有两种选择,如下图所示:
代码:
题目:
n
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n
思路:这道题目本质上是个动态规划的问题,虽然也可以用递归的方法做,但是时间复杂度太高,那么用动态规划就需要建立状态转移方程:X(i) = X(i-1) + X(i-2);
每次有两种选择,两种选择之后又是各有两种选择,如下图所示:
代码:
上一篇:69. Sqrt(x)
如何通过MySQL提升DISTINCT,尤其是多表连接下DISTINCT的查询效率?
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 cl
举报文章
请选择举报类型
补充说明
0/200
上传截图
格式支持JPEG/PNG/JPG,图片不超过1.9M