小小程序媛 |
|
||
得之坦然,失之淡然,顺其自然,争其必然 |
2015年12月26日
摘要:
题目 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed fro 阅读全文
摘要:
题目 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 阅读全文
|
Copyright © 2024 Coding菌
Powered by .NET 9.0 on Kubernetes |