VulpineAmethyst
/
candidwords
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

move current algorithm in to a function

current
Síle Ekaterin Liszka 2022-09-28 04:03:29 -07:00
parent 76cddb1ee4
commit d53ba24f96
1 changed files with 39 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

68
wordle.cc
View File

@ -41,6 +41,42 @@
void usage(char *);
std::vector<std::string> green_search(std::string invalid, std::string yellow, std::string green) {
std::vector<std::string> candidates;
for (std::vector<std::string>::size_type i = 0; i < wordv.size(); i++) {
bool valid = false;
std::string word(wordv[i]);
for (int j = 0; j < 5; j++) {
if (invalid.find(word[j]) != std::string::npos) {
valid = false;
break;
}
if (green[j] == '?') {
continue;
}
if (word[j] == green[j]) {
valid = true;
}
else {
valid = false;
break;
}
}
for (std::string::size_type j = 0; j < yellow.length(); j++) {
if (word.find(yellow[j]) == std::string::npos) {
valid = false;
break;
}
}
if (valid) {
candidates.push_back(word);
}
}
return candidates;
}
int main(int argc, char **argv) {
if (argc != 4) {
usage(argv[0]);
@ -81,36 +117,10 @@ int main(int argc, char **argv) {
invalid.append(1, guessed[i]);
}
}
if (green != "?????") {
candidates = green_search(invalid, yellow, green);
}
for (std::vector<std::string>::size_type i = 0; i < wordv.size(); i++) {
bool valid = false;
std::string word(wordv[i]);
for (int j = 0; j < 5; j++) {
if (invalid.find(word[j]) != std::string::npos) {
valid = false;
break;
}
if (green[j] == '?') {
continue;
}
if (word[j] == green[j]) {
valid = true;
} else {
valid = false;
break;
}
}
for (std::string::size_type j = 0; j < yellow.length(); j++) {
if (word.find(yellow[j]) == std::string::npos) {
valid = false;
break;
}
}
if (valid) {
candidates.push_back(word);
}
}
std::for_each(candidates.begin(), candidates.end(), [](std::string n) { std::cout << n << " "; });
std::cout << std::endl;
}