动态规划专项训练
文章平均质量分 56
WEW_diger
这个作者很懒,什么都没留下…
展开
-
leetcode之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? class Solution { publi...原创 2018-08-15 00:04:59 · 119 阅读 · 0 评论 -
leetcode之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 right at any point in time. The robot is trying to reach t...原创 2018-08-15 00:08:04 · 152 阅读 · 0 评论