链接:http://leetcode.com/onlinejudge#question_115
原题:
Given a string S and a string T, count the number of distinct subsequences of T in S.
A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ACE"
is a subsequence of"ABCDE"
while "AEC"
is not).
Here is an example:
S = "rabbbit"
, T = "rabbit"
Return 3
.
思路:一道动态规划题目,用state[i][j]记录S长为i, T长为j的字符串个数;
1) 当然 i < j,state[i][j] = 0;
2) 当i >= j时候,如果 S[i] == T[j],那么可以把最后一个元素对上,归结为state[i-1][j-1],也可以不对上,把S[i]直接删除,就归结为state[i-1][j]
所以, state[i][j] = state[i-1][j-1] + state[i-1][j];反之,如果S[i] != T[j], 直接删除S[i]就可以了,那么 state[i][j] = state[i-1][j]。
再仔细想一下,其实开这个二维数组,是没有必要,只要一维数组就可以了,从末尾开始更新到首部。
代码:
class Solution {
public:
int numDistinct(string S, string T) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int col = T.size() + 1;
int row = S.size() + 1;
vector<int> state(col, 0);
state[0] = 1;
for (int i=1; i<row; i++) {
for (int j=col-1; j>0; j--) {
if (j > i)
continue;
if (S[i-1] == T[j-1])
state[j] += state[j-1];
}
}
return state[col-1];
}
};