mirrors/CLI11
1
0
Fork 0
mirror of https://github.com/CLIUtils/CLI11.git synced 2025-04-29 12:13:52 +00:00
Code Issues Releases Wiki Activity

fix pre-commit items

Browse Source
This commit is contained in:
Philip Top 2025-04-21 09:27:50 -07:00
parent 3021257c04
commit 4373489273
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
examples/close_match.cpp
View File

@ -25,21 +25,21 @@ int levenshteinDistance(const std::string &s1, const std::string &s2) {
for(size_t i = 1; i <= len1; ++i) {
for(size_t j = 1; j <= len2; ++j) {
int cost = (s1[i - 1] == s2[j - 1]) ? 0 : 1;
dp[i][j] = std::min({
dp[i - 1][j] + 1, // deletion
dp[i][j - 1] + 1, // insertion
dp[i - 1][j - 1] + cost // substitution
});
dp[i][j] = (std::min)({
dp[i - 1][j] + 1, // deletion
dp[i][j - 1] + 1, // insertion
dp[i - 1][j - 1] + cost // substitution
});
}
}
return dp[len1][len2];
}
// Finds the closest string from a list
// Finds the closest string from a list (modified from chat gpt code)
std::pair<std::string, int> findClosestMatch(const std::string &input, const std::vector<std::string> &candidates) {
std::string closest;
int minDistance = std::numeric_limits<int>::max();
int minDistance = (std::numeric_limits<int>::max)();
for(const auto &candidate : candidates) {
int distance = levenshteinDistance(input, candidate);