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/find_replace_pattern.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/find_replace_pattern.cpp')
-rw-r--r-- | other/find_replace_pattern.cpp | 32 |
1 files changed, 0 insertions, 32 deletions
diff --git a/other/find_replace_pattern.cpp b/other/find_replace_pattern.cpp deleted file mode 100644 index a00bfcb..0000000 --- a/other/find_replace_pattern.cpp +++ /dev/null @@ -1,32 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<string> findAndReplacePattern(vector<string> &words, string pattern) { - ans.resize(0); - codex.clear(); - cipher = pattern; - for (int i = 0; i < pattern.size(); i++) - cipher[i] = translate(cipher[i]); - for (auto &word : words) - compare(word); - return ans; - } - -private: - vector<string> ans; - unordered_map<char, char> codex; - string cipher; - char translate(char &c) { - if (codex.find(c) == codex.end()) - codex[c] = (char)(97 + codex.size()); - return codex[c]; - } - void compare(string &word) { - codex.clear(); - for (int i = 0; i < word.size(); i++) - if (translate(word[i]) != cipher[i]) - return; - ans.push_back(word); - } -}; |