2015年1月11日
[LeetCode] Climbing Stairs （Sequence DP）
摘要： 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 disti... 阅读全文
posted @ 2015-01-11 22:32 Acjx 阅读(361) 评论(0) 推荐(0)
[LeetCode] Unique Paths && Unique Paths II && Minimum Path Sum （动态规划之 Matrix DP ）
摘要： Unique Paths https://oj.leetcode.com/problems/unique-paths/ A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or ... 阅读全文
posted @ 2015-01-11 20:11 Acjx 阅读(470) 评论(0) 推荐(0)