Update 0648-replace-words.cpp #1
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
karygauss03 commented Jun 7, 2024
Comment on lines +1 to +64
| struct TrieNode { | ||
| char data; | ||
| bool isPrefix; | ||
| TrieNode* children[26]; | ||
| }; | ||
| | ||
| class Solution { | ||
| private: | ||
| vector<string> tokenizer(string& line) { | ||
| vector<string> tokens; | ||
| stringstream check1(line); | ||
| string intermediate; | ||
| while (getline(check1, intermediate, ' ')) { | ||
| tokens.push_back(intermediate); | ||
| } | ||
| return tokens; | ||
| } | ||
| | ||
| public: | ||
| string replaceWords(vector<string>& dict, string sentence) { | ||
| sort(dict.begin(), dict.end()); | ||
| int n = sentence.size(); | ||
| string tmp = ""; | ||
| string ans = ""; | ||
| for (int i = 0 ; i < n ; i++){ | ||
| if (sentence[i] == ' '){ | ||
| bool flag = false; | ||
| for (auto &s : dict){ | ||
| if (s == tmp.substr(0, s.size())){ | ||
| ans += s; | ||
| ans += ' '; | ||
| flag = true; | ||
| break; | ||
| } | ||
| } | ||
| if (!flag){ | ||
| ans += tmp; | ||
| ans += ' '; | ||
| } | ||
| tmp = ""; | ||
| } | ||
| else { | ||
| tmp += sentence[i]; | ||
| TrieNode nodepool[100000]; // Pool of 100K TrieNodes | ||
| TrieNode* root; // Root of Trie | ||
| int poolcount; // Always points to next free TrieNode | ||
| | ||
| void init() { | ||
| poolcount = 0; | ||
| root = &nodepool[poolcount++]; | ||
| root->data = '/'; | ||
| root->isPrefix = false; | ||
| for (int i = 0; i < 26; ++i) { | ||
| root->children[i] = nullptr; | ||
| } | ||
| } | ||
| | ||
| TrieNode* getNode(char c) { | ||
| TrieNode* node = &nodepool[poolcount++]; | ||
| node->data = c; | ||
| node->isPrefix = false; | ||
| for (int i = 0; i < 26; ++i) { | ||
| node->children[i] = nullptr; | ||
| } | ||
| return node; | ||
| } | ||
| | ||
| void insert(string& word) { | ||
| TrieNode* current = root; | ||
| for (auto& c : word) { | ||
| if (current->children[c - 'a'] == nullptr) { | ||
| current->children[c - 'a'] = getNode(c); | ||
| } | ||
| current = current->children[c - 'a']; | ||
| } | ||
| bool flag = false; | ||
| for (auto &s : dict){ | ||
| if (s == tmp.substr(0, s.size())){ | ||
| ans += s; | ||
| ans += ' '; | ||
| flag = true; | ||
| current->isPrefix = true; | ||
| } | ||
| | ||
| bool search(string& prefix) { | ||
| TrieNode* current = root; | ||
| for (char& c : prefix) { | ||
| if (current->children[c - 'a'] == nullptr) { | ||
| return false; | ||
| } | ||
| current = current->children[c - 'a']; | ||
| } | ||
| return current->isPrefix; | ||
| } |
There was a problem hiding this comment.
TO ME, please try to have a Trie class separately to be used in future problems directly.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit. This suggestion is invalid because no changes were made to the code. Suggestions cannot be applied while the pull request is closed. Suggestions cannot be applied while viewing a subset of changes. Only one suggestion per line can be applied in a batch. Add this suggestion to a batch that can be applied as a single commit. Applying suggestions on deleted lines is not supported. You must change the existing code in this line in order to create a valid suggestion. Outdated suggestions cannot be applied. This suggestion has been applied or marked resolved. Suggestions cannot be applied from pending reviews. Suggestions cannot be applied on multi-line comments. Suggestions cannot be applied while the pull request is queued to merge. Suggestion cannot be applied right now. Please check back later.
No description provided.