2019年2月11日
115. Distinct Subsequences
摘要： Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string which is for 阅读全文
posted @ 2019-02-11 22:40 Veritas_des_Liberty 阅读(172) 评论(0) 推荐(0)
97. Interleaving String
摘要： Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Example 2: Approach #1: DP. [C++] Analysis: status: match[s1L 阅读全文
posted @ 2019-02-11 22:13 Veritas_des_Liberty 阅读(232) 评论(0) 推荐(0)
96. Unique Binary Search Trees
摘要： Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example: Approach #1: DP. [C++] Analysis: status: nums[n] 阅读全文
posted @ 2019-02-11 21:26 Veritas_des_Liberty 阅读(248) 评论(0) 推荐(0)