- 博客(2)
- 资源 (1)
- 收藏
- 关注
原创 LeetCode||97. 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", ret
2018-02-02 15:39:04 252
原创 LeetCode||96. Unique Binary Search Trees
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. 1 3 3 2 1 \
2018-02-02 15:25:24 267
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人