-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathMagicDictionary.cpp
More file actions
53 lines (42 loc) · 1.31 KB
/
Copy pathMagicDictionary.cpp
File metadata and controls
53 lines (42 loc) · 1.31 KB
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
//Copyright [2018] [Haibo Yan]
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.
//
// Created by haibo on 3/24/18.
//
#include "MagicDictionary.h"
#include <algorithm>
void MagicDictionary::buildDict(vector<string> dict) {
dict_ = dict;
sort(dict_.begin(), dict_.end());
}
bool MagicDictionary::search(string word) {
auto l = lower_bound(dict_.begin(), dict_.end(), word);
auto u = upper_bound(dict_.begin(), dict_.end(), word);
for (auto iter = prev(l); iter != u; iter++) {
if (diff(*iter, word) == 1) {
return true;
}
}
return false;
}
int MagicDictionary::diff(string s1, string s2) {
if (s1.size() != s2.size()) return -1;
int diff = 0;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] != s2[i]) {
diff++;
}
}
return diff;
}