![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dynamic programming
文章平均质量分 53
yanrui92
这个作者很懒,什么都没留下…
展开
-
leetcode-unique binary search tree II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below.public class原创 2015-01-28 07:20:44 · 279 阅读 · 0 评论 -
leetcode-climbing stairs
Climbing Stairs Total Accepted: 36520 Total Submissions: 107274My SubmissionsQuestion Solution You are climbing a stair case. It takes n steps to reach to the top.Each time you原创 2015-01-10 05:14:02 · 262 阅读 · 0 评论 -
leetcode-edit distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:原创 2015-01-10 05:44:38 · 279 阅读 · 0 评论