Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat:add Solution.cpp for 0115. Distinct Subsequences #324

Merged
merged 1 commit into from
Dec 24, 2020
Merged

feat:add Solution.cpp for 0115. Distinct Subsequences #324

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
feat:add Solution.cpp for 0115. Distinct Subsequences
  • Loading branch information
@Stackingrule
Stackingrule committed Dec 24, 2020
commit 8f3b0bdab1b090b1472959a4146b29f84c78f2d8
14 changes: 14 additions & 0 deletions solution/0100-0199/0115.Distinct Subsequences/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
class Solution {
public:
int numDistinct(string s, string t) {
int m = s.size(), n = t.size();
vector<vector<long>> dp(n + 1, vector<long>(m + 1));
for (int j = 0; j <= m; ++j) dp[0][j] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
dp[i][j] = dp[i][j - 1] + (t[i - 1] == s[j - 1] ? dp[i - 1][j - 1] : 0);
}
}
return dp[n][m];
}
};