- 博客(2)
- 收藏
- 关注
原创 [LeetCode P97] Interleaving String动态规划
原题:Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = "aabcc", s2 = "dbbca",When s3 = "aadbbcbcac", return true. When s3 = "aadbbbaccc", return false.
2017-09-07 10:36:24 307
原创 [LeetCode P96] Unique Binary Search Trees II
原题:原题: Given an integer 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. 1
2017-09-06 17:06:08 284
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人