aboutsummaryrefslogtreecommitdiff
path: root/longest_common_subseq.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'longest_common_subseq.cpp')
-rw-r--r--longest_common_subseq.cpp20
1 files changed, 0 insertions, 20 deletions
diff --git a/longest_common_subseq.cpp b/longest_common_subseq.cpp
deleted file mode 100644
index 56cbaf9..0000000
--- a/longest_common_subseq.cpp
+++ /dev/null
@@ -1,20 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- int longestCommonSubsequence(string text1, string text2) {
- short ans[2][1000] = {};
- for (int i = 0; i < text1.size(); ++i)
- for (int j = 0; j < text2.size(); ++j)
- ans[!(i % 2)][j + 1] = text1[i] == text2[j]
- ? ans[i % 2][j] + 1
- : max(ans[i % 2][j + 1], ans[!(i % 2)][j]);
- return ans[text1.size() % 2][text2.size()];
- }
-};
-
-int main() {
- Solution obj;
- cout << obj.longestCommonSubsequcne("abcde", "ace"); // 3
- cout << endl << obj.longestCommonSubsequcne("abc", "abc"); // 3
-}