diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/longest_common_subseq.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/longest_common_subseq.cpp')
-rw-r--r-- | other/longest_common_subseq.cpp | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/other/longest_common_subseq.cpp b/other/longest_common_subseq.cpp deleted file mode 100644 index 56cbaf9..0000000 --- a/other/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 -} |