KMP (Knuth-Morris-Pratt) algorithm introduction to algorithm 3rd, example 32.4

算法导论 第三版 32.4 KMP


//KMP (Knuth-Morris-Pratt) algorithm introduction to algorithm 3rd, example 32.4


#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <ostream>
#include <iterator>
#include <limits>
#include <complex>
#include "stopwatch.h"


std::vector<size_t> compute_prefix(const std::string & str)
{
    std::vector<size_t> prefix(str.size(), 0);
    size_t ip = 0;
    for (size_t is = 1; is < str.size(); ++is)
    {
        while (ip > 0 && str[ip] != str[is])
        {
            ip = prefix[ip-1];
        }
        if (str[ip] == str[is])
        {
            ++ip;
        }
        prefix[is] = ip;
    }

    return prefix;
}

std::vector<size_t> kmp_match(const std::string &s1, const std::string & s2, const std::vector<size_t> & prefixes)
{
    std::vector<size_t> indexes;
    size_t ip = 0;
    for (size_t is = 0; is < s1.size(); ++is)
    {
        while (ip > 0 && s1[is] != s2[ip])
        {
            ip = prefixes[ip-1];
        }

        if (s1[is] == s2[ip])
        {
            ++ip;
        }
        if (ip == prefixes.size())
        {
            ip = prefixes[ip-1];
            indexes.push_back(is);
        }
    }

    return indexes;
}

void test(std::string && s1, std::string && s2)
{
    std::cout << "Match " << s1 << "  with " << s2 << std::endl;
    Stopwatch watch;
    watch.start();
    auto prefixes = compute_prefix(s2);
    auto indexes = kmp_match(s1, s2, prefixes);
    watch.stop();
    std::cout << "prefix of " << s2 << " is ";
    std::copy(prefixes.begin(), prefixes.end(), std::ostream_iterator<size_t>(std::cout, " "));
    std::cout << std::endl;
    std::cout << "Match string at index ";
    std::copy(indexes.begin(), indexes.end(), std::ostream_iterator<size_t>(std::cout, " "));
    std::cout << " use time " << watch.elapsed() << " ms\n" << std::endl;
}

int main()
{
    std::cout << "start" << std::endl;
    test(std::string("aaababaabaababaab"), std::string("aabab"));
    test(std::string("bacbababacaabcbab"), std::string("ababaca"));
    test(std::string("aaabaabaabaabaabaab"), std::string("aabaab"));

    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值