qq_34609108的博客

动态规划（dynamic programing）是通过组合子问题的解而解决整个问题的。这里Programming 翻译写成规划而不是编程。维基百科上写到 This is  also usually done in a tublar form by iteratively genereting solutions to bigger and bigger subprobleams by usin

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.Example 1:Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac" Output: true Example 2:Input: s1 = "aabcc", s2 = "dbbca", s3...

转自 ：  https://blog.youkuaiyun.com/feliciafay/article/details/42959119Given 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 ...