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/delete_operation_2string.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/delete_operation_2string.cpp')
-rw-r--r-- | other/delete_operation_2string.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/delete_operation_2string.cpp b/other/delete_operation_2string.cpp deleted file mode 100644 index b6e38e4..0000000 --- a/other/delete_operation_2string.cpp +++ /dev/null @@ -1,26 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minDistance(string word1, string word2) { - int m = word1.size(), n = word2.size(); - if (m < n) { - swap(word1, word2); - swap(n, m); - } - vector<int> last(n + 1, 0), curr(n + 1, 0); - for (char char1 : word1) { - for (int i = 0; i < n; i++) - curr[i + 1] = - char1 == word2[i] ? last[i] + 1 : max(curr[i], last[i + 1]); - swap(last, curr); - } - return m + n - 2 * last[n]; - } -}; - -int main() { - Solution obj; - string word1 = "sea", word2 = "eat"; - cout << obj.minDistance(word1, word2); -} |