![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
取个名怎么就这么难
并没有什么介绍的
展开
-
leetcode Editdistance
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-11-28 20:39:28 · 240 阅读 · 0 评论 -
leetcode Unique Binary Search Trees II 答案详解
Given n, generate all structurally uniqueBST'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. 1原创 2015-12-17 21:17:03 · 349 阅读 · 0 评论 -
Unique Binary Search Trees leetcode答案解析
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 给一个整数n,求以1~n共能组成多少种二叉搜索树动态规划题,创建一数组ans原创 2015-12-17 21:06:15 · 324 阅读 · 0 评论