backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-08 23:23:05 +08:00
Code Issues Projects Releases Wiki Activity

clang-tidy fixes

Browse Source
This commit is contained in:
Krishna Vedala
2020-08-27 09:19:10 -04:00
parent e19260c869
commit 0b4babe8c1
1 changed files with 19 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
data_structures/trie_tree.cpp
View File

@@ -31,15 +31,18 @@ class trie {
* @returns `tre` if found
* @returns `false` if not found
*/
bool search(std::shared_ptr<trie> root, const std::string& str, int index) {
bool search(const std::shared_ptr<trie>& root, const std::string& str,
int index) {
if (index == str.length()) {
if (!root->isEndofWord)
if (!root->isEndofWord) {
return false;
}
return true;
}
int j = str[index] - 'a';
if (!root->arr[j])
if (!root->arr[j]) {
return false;
}
return search(root->arr[j], str, index + 1);
}
@@ -81,13 +84,15 @@ class trie {
*/
bool search(const std::string& str, int index) {
if (index == str.length()) {
if (!isEndofWord)
if (!isEndofWord) {
return false;
}
return true;
}
int j = str[index] - 'a';
if (!arr[j])
if (!arr[j]) {
return false;
}
return search(arr[j], str, index + 1);
}
@@ -104,8 +109,9 @@ class trie {
// std::shared_ptr<trie> root (nullptr);
if (index == str.length()) {
if (!isEndofWord)
if (!isEndofWord) {
return false;
}
isEndofWord = false;
// for (int i = 0; i < NUM_CHARS; i++)
// if (root->arr[i])
@@ -113,18 +119,21 @@ class trie {
return true;
}
int j = str[index] - 'a';
if (!arr[j])
if (!arr[j]) {
return false;
}
bool var = deleteString(str, index + 1);
if (var) {
arr[j].reset();
if (isEndofWord) {
return false;
} else {
int i;
for (i = 0; i < NUM_CHARS; i++)
if (arr[i])
int i = 0;
for (i = 0; i < NUM_CHARS; i++) {
if (arr[i]) {
return false;
}
}
return true;
}
}