Boyer-Moore algorithm ---c++

最新推荐文章于 2020-03-22 16:48:05 发布

ranyongqing

最新推荐文章于 2020-03-22 16:48:05 发布

阅读量558

点赞数

分类专栏： C++ 文章标签： c++ 算法

本文链接：https://blog.csdn.net/ranyongqing/article/details/26622223

版权

C++ 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

i do not speak the algorithm principle, you can get this knowledge in my blog.

/*************************************************************************
	> File Name: Boyer_Moore.cpp
	> Author: ryq
	> Email: ranyongqing@163.com 
	> Created Time: 2014年05月22日 星期四 19时30分56秒
 ************************************************************************/

#include<iostream>
#include<string>
#include<utility>
using namespace std;

pair<string,int> Boyer_Moore(string &src, string &des)
{
    int size = src.size();
    int len = des.size();
    string str;
    if(len > size)
        return  make_pair(str,-1);
    int i,j;
    i = j = len-1;
    int k = 0;// record the number of  good chars; 
    for(; i < size && j >= 0;){
        if(src[i] == des[j]){
            i--;
            j--;
            k++;
        }
        else{
            if(k == 0){
                size_t found = des.find_last_of(src[i]);
                if(found == string::npos)
                    i += len-1;
                else
                    i += len -1 - found;
            }
            else{
                size_t found = des.find_first_of(src[i+k]);
                if(found == len-1){
                    i = i + k + len -1;
                    j = len - 1;
                }
                else{
                    i = i + len - found - 1;
                    j = len - 1;
                } 
                k = 0;
            }
        }
    }
    if(j < 0)
        return make_pair(des,i+1);
    else
        return make_pair(str,-1);
    
}

int main()
{
    pair<string,int>res;
    string src = "BBCABCDABD ABCDABCDABE";
    string des = "BCDABE";
    res = Boyer_Moore(src,des);
    cout<<res.first<<" "<<res.second<<endl;
}