leetcode Climbing Stairs
来源:互联网 发布:淘宝super制造 编辑:程序博客网 时间:2024/05/17 06:56
最近开始刷leetcode的题,一直不太会做动态规划的题目,先找这方面题目做一做,用java。
目前动态规划的题目已经做完,再从易到难总结一下。
Climbing stairs 原题地址:
https://oj.leetcode.com/problems/climbing-stairs/
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?
n阶台阶,一次走一阶或两阶,有多少种不同的走法。求走到第i阶台阶的走法,等于走到第i-2阶台阶的走法(再一次走两阶)加上走到第i-1阶台阶的走法(再走一阶)。
即f(i) = f(i-2) + f(i-1), i > 2, f(0) = 0, f(1) = 1, f(2) = 2
public class Solution { public int climbStairs(int n) { if (n == 0) return 0; if (n == 1) return 1; if (n == 2) return 2; int a = 1; int b = 2; for (int i = 2; i < n; i++) { int temp = a; a = b; b = temp + b; } return b; }}
0 0
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- [LeetCode]Climbing Stairs
- [leetcode]Climbing Stairs
- LeetCode-Climbing Stairs
- [leetcode] Climbing Stairs
- LeetCode - Climbing Stairs
- LeetCode:Climbing Stairs
- Leetcode Climbing Stairs
- LeetCode | Climbing Stairs
- Hihocode Trie树代码
- GNOME终端(terminal)字体配置
- 浅谈css和div布局
- 太烦!Instagram大规模植入15秒视频广告
- 机器学习总结
- leetcode Climbing Stairs
- LR笔记
- redis五种数据类型的使用
- Linux 进程状态
- android快速开发框架 可以一个个学习总结
- 用CodeViz绘制函数调用关系图(call graph)
- Servlet 编写过滤器
- 程序猿之--医保卡的正确使用
- 通过表名和字段名查询字段类型