c++怎么实现一个简单的模糊搜索算法_C++中实现模糊匹配与编辑距离算法

#include 
#include 
#include 
#include 

int levenshteinDistance(const std::string& a, const std::string& b) {
    int m = a.size();
    int n = b.size();
    std::vector> dp(m + 1, std::vector(n + 1));

    // 初始化边界：从空串变成目标串
    for (int i = 0; i <= m; i++) dp[i][0] = i;
    for (int j = 0; j <= n; j++) dp[0][j] = j;

    // 填表
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i-1] == b[j-1]) {
                dp[i][j] = dp[i-1][j-1]; // 相同字符，无需操作
            } else {
                dp[i][j] = 1 + std::min({
                    dp[i-1][j],   // 删除
                    dp[i][j-1],   // 插入
                    dp[i-1][j-1]  // 替换
                });
            }
        }
    }
    return dp[m][n];
}

void fuzzySearch(const std::vector& dictionary,
                 const std::string& query,
                 int maxDistance = 2) {
    std::cout << "Searching for: " << query << "\n";
    std::cout << "Results (distance <= " << maxDistance << "):\n";

    for (const auto& word : dictionary) {
        int dist = levenshteinDistance(query, word);
        if (dist <= maxDistance) {
            std::cout << "  \"" << word << "\" (distance: " << dist << ")\n";
        }
    }
}

int main() {
    std::vector words = {
        "apple", "apply", "apples", "banana", "orange",
        "application", "applet", "hello", "help"
    };

    fuzzySearch(words, "appl", 1);   // 应该匹配 apple, apply, applet 等
    return 0;
}