摘要：
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representati 阅读全文
摘要：
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. 题意： 给定s1和s2，判断给定的s3是不是s1和s2交织相错后可以生成的字符串 思路： 遇到字符串的子序列或匹配问题巴普洛夫狗流哈喇子实验般的 阅读全文
摘要：
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 阅读全文
摘要：
Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is po 阅读全文
摘要：
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitt 阅读全文