[leetcode]115. Distinct Subsequences

-题目连接:[https://leetcode.com/problems/distinct-subsequences] - 题意:给定字符串S和T, 求S中有多少个不一样子序列(subsequence)等于T。web 注:子序列(subsequence)不一样于子串(substring),子串必须相邻,子序列没必要相邻。e.g.”ACE” is a subsequence of “ABCDE” w
相关文章
相关标签/搜索