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

trie_tree.cpp: #include <string.h> --> <string> (#684)

Browse Source 
* trie_tree.cpp: #include <string.h> --> <string>

* std::string str
This commit is contained in:
Christian Clauss
2019-12-19 12:48:43 +01:00
committed by GitHub
parent 8e36a38729
commit b5a074f188
1 changed files with 18 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
data_structure/trie_tree.cpp
View File

@@ -1,14 +1,14 @@
#include <stdio.h>
#include <string.h>
#include <stdbool.h>
#include <iostream>
#include <string>
// structure definition
typedef struct trie {
struct trie * arr[26];
bool isEndofWord;
}
trie;
} trie;
// create a new node for trie
trie * createNode() {
@@ -20,8 +20,8 @@ trie * createNode() {
}
// insert string into the trie
void insert(trie * root, char * str) {
for (int i = 0; i < strlen(str); i++) {
void insert(trie * root, std::string str) {
for (int i = 0; i < str.length(); i++) {
int j = str[i] - 'a';
if (root -> arr[j]) {
root = root -> arr[j];
@@ -34,8 +34,8 @@ void insert(trie * root, char * str) {
}
// search a string exists inside the trie
bool search(trie * root, char * str, int index) {
if (index == strlen(str)) {
bool search(trie * root, std::string str, int index) {
if (index == str.length()) {
if (!root -> isEndofWord)
return false;
return true;
@@ -46,11 +46,13 @@ bool search(trie * root, char * str, int index) {
return search(root -> arr[j], str, index + 1);
}
/* removes the string if it is not a prefix of any other
string, if it is then just sets the endofword to false, else
removes the given string*/
bool deleteString(trie * root, char * str, int index) {
if (index == strlen(str)) {
/*
removes the string if it is not a prefix of any other
string, if it is then just sets the endofword to false, else
removes the given string
*/
bool deleteString(trie * root, std::string str, int index) {
if (index == str.length()) {
if (!root -> isEndofWord)
return false;
root -> isEndofWord = false;
@@ -79,13 +81,10 @@ bool deleteString(trie * root, char * str, int index) {
int main() {
trie * root = createNode();
char hello[] = "hello";
char world[] = "world";
char word[] = "word";
insert(root, hello);
insert(root, world);
int a = search(root, hello, 0);
int b = search(root, word, 0);
insert(root, "hello");
insert(root, "world");
int a = search(root, "hello", 0);
int b = search(root, "word", 0);
printf("%d %d ", a, b);
return 0;
}