115. Distinct Subsequences(不同的子序列)

題目鏈接：https://leetcode.com/problems/distinct-subsequences/ 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 whic

>>阅读原文<<