Given a string S and a string T, count the number of distinct subsequences of T in S. status: dp[i][j] means the numbers of first i-1 chars in T is matched first j-1 chars in S initialize: dp[i][0] = ...
//52 / 63 test cases passed. //Runtime: 476 ms, faster than 8.83% of C++ online submissions for Distinct Subsequences. //Memory Usage: 113.1 MB, less than 5.01% of C++ online submissions for Distinct ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results