-
Notifications
You must be signed in to change notification settings - Fork 0
/
Compelte_string.cpp
79 lines (73 loc) · 1.71 KB
/
Compelte_string.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
struct Node {
Node* links[26];
bool flag = false;
bool containKey(char ch){
return (links[ch - 'a'] != NULL);
}
void put(char ch,Node* node){
links[ch - 'a'] = node;
}
Node* get(char ch){
return links[ch - 'a'];
}
void end(){
flag = true;
}
bool isEnd(){
return flag;
}
};
class Trie {
private : Node* root;
public :
Trie(){
root = new Node();
}
void insert(string word) {
Node* node = root;
for(int i = 0;i < word.size();i ++){
if(!node->containKey(word[i])){
node->put(word[i],new Node());
}
node = node->get(word[i]);
}
node->end();
}
bool checkIfPrefixExits(string &word){
bool flag = true;
Node* node = root;
for(int i = 0;i < word.size();i ++){
if(node->containKey(word[i])){
node = node->get(word[i]);
flag = (flag & node->isEnd());
}else {
return false;
}
}
return flag;
}
};
string completeString(int n, vector<string> &a){
// Write your code here.
Trie* obj = new Trie();
string longest="";
for(auto word: a){
obj->insert(word);
}
for(auto word : a){
if(obj->checkIfPrefixExits(word)){
if(word.size() > longest.size()){
longest =word;
}else if(word.size() == longest.size()){
if(word < longest){
longest = word;
}
}
}
}
if(longest == ""){
longest = "None";
}
return longest;
}