LeetCode115 不一樣的子序列

Given a string S and a string T, count the number of distinct subsequences of S which equals T.web A subsequence of a string is a new string which is formed from the original string by deleting some (

>>阅读原文<<