KMP C++

來源:互聯網
上載者:User

標籤:new   c++   let   out   turn   cout   pre   nbsp   kmp   

KMP C++實現

int * ComputeNext(string P){    int *lsp{ new int[P.length()] };    lsp[0] = 0;  // Base case    int j = 0;    for (int i = 1; i < P.length(); i++)    {//        int j = lsp[i - 1];        while (j > 0 && P.at(i) != P.at(j))            j = lsp[j];        if (P.at(i) == P.at(j))            j++;        lsp[i] = j;    }    return lsp;}int search(string P, string T){    int *lsp= ComputeNext(P);    for (int var = 0; var < P.length(); var++)    {        cout << *(lsp+var) << " ";    }    cout<<endl;    int j = 0;                                    for (int i = 0; i < T.length(); i++)    {        while (j > 0 && T.at(i)!= P.at(j))        {                                                j = *(lsp+j);                                cout<<"-i:"<<j<<endl;        }        cout<<i<<" "<<T.at(i)<<","<<j<<" "<<P.at(j)<<"|| ";        if (T.at(i) == P.at(j))        {            j++;            if (j == P.length())                return (i -P.length()+1) ;            cout<<T.at(i)<<","<<P.at(j)<<":";        }        cout<<i<<"-"<<j<<endl;    }    delete []lsp;    return -1;        }

 

KMP C++

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.