Leetcode之Distinct Subsequences 问题

问题描述： Given a string S and a string T, count the number of distinct subsequences of S whichequals T. A subsequence of a string is a new string which is formed from the original string bydeleting some

>>阅读原文<<