LeetCode Distinct Subsequences

最新推荐文章于 2014-09-24 00:58:52 发布

kassical

最新推荐文章于 2014-09-24 00:58:52 发布

阅读量441

点赞数

分类专栏： LeetCode 文章标签： leetcode 动态规划

本文链接：https://blog.csdn.net/kassical/article/details/38730645

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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.

class Solution {
public:
	int numDistinct(string S, string T) {
		int n = S.length();
		int m = T.length();
		if (n <= 0 || m <= 0)
			return 0;

		vector<vector<int> > ivecArray(n + 1, vector<int> (m + 1, 0));
		for (int i = 0; i < n; i++)
			ivecArray[i][0] = 1;

		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (S[i - 1] == T[j - 1])
					ivecArray[i][j] = ivecArray[i - 1][j] + ivecArray[i - 1][j - 1];
				else
					ivecArray[i][j] = ivecArray[i - 1][j];
			}
		}
		return ivecArray[n][m];
	}
};

递归超时

class Solution {
public:
	int numDistinct(string S, string T) {
		if (S.size() <= 0 || T.size() <= 0)
			return 0;

		int ret = 0;
		recursive(S, T, 0, 0, ret);
		return ret;
	}

	void recursive(string &S, string &T, int S_num, int T_num, int &ret) {
		if (T_num == T.size()){
			ret++;
			return;
		}
		for (int i = S_num; i < S.size(); i++) {
			if (S[i] == T[T_num])
				recursive(S, T, i + 1, T_num + 1, ret);
		}
	}
};