aboutsummaryrefslogtreecommitdiff
path: root/other/longest_common_subseq.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/longest_common_subseq.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/longest_common_subseq.cpp')
-rw-r--r--other/longest_common_subseq.cpp20
1 files changed, 20 insertions, 0 deletions
diff --git a/other/longest_common_subseq.cpp b/other/longest_common_subseq.cpp
new file mode 100644
index 0000000..56cbaf9
--- /dev/null
+++ b/other/longest_common_subseq.cpp
@@ -0,0 +1,20 @@
+#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
+}