KMP排序

103 阅读 0 评论 68 点赞

我是靠谱客的博主无奈斑马，这篇文章主要介绍KMP排序，现在分享给大家，希望可以做个参考。

Implement strStr().

Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Example 1:

复制代码

1
2
Input: haystack = "hello", needle = "ll"
Output: 2

Example 2:

复制代码

1
2
Input: haystack = "aaaaa", needle = "bba"
Output: -1

复制代码

class Solution {
public:
    
      //普通字符串匹配    
      int strStr(string haystack, string needle) {
        if(haystack.empty()&&needle.empty())
            return 0;
        int n = haystack.length();
        int m = needle.length();
        int i;
        for(i=0; i<n; i++)
        {
            int j;
            for(j=0; j<m; j++)
            {
                if(needle[j]!=haystack[i+j])
                    break;
            }
            if(j==m)
                break;
        }
        return i==n ? -1 : i;
        
    }
    
    //KMP算法
    void MakeNext(string pattern, int *next)
    {
        int k=0;
        int m = pattern.length();
        next[0] = 0;
        int i=0;
        for(i=1; i<m; i++)
        {
            while(k>0&&pattern[i]!=pattern[k])
                k = next[k-1];
            if(pattern[i] == pattern[k])
                k++;
            next[i] = k;
          
        }
    }
    
    int strStr(string haystack, string needle) {
        if((haystack.empty()|| !haystack.empty())&&needle.empty())
            return 0;
        int n = haystack.length();
        int m = needle.length();
        int *next = new int[m];
        MakeNext(needle, next);
        int i,p;
        cout<<n<<"@"<<m<<endl;
        for(i=0,p=0;i<n; i++)
        {
         
            while(p>0&&haystack[i]!=needle[p])
                p = next[p-1];
            if(haystack[i]==needle[p])
                p++;
            if(p==m)
            {
                cout<<"pattern"<<endl;
                return i-m+1;
            }
        }
        cout<<i<<" "<<p<<endl;
        return -1;
    }

};

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
class Solution {
public:
    
      //普通字符串匹配    
      int strStr(string haystack, string needle) {
        if(haystack.empty()&&needle.empty())
            return 0;
        int n = haystack.length();
        int m = needle.length();
        int i;
        for(i=0; i<n; i++)
        {
            int j;
            for(j=0; j<m; j++)
            {
                if(needle[j]!=haystack[i+j])
                    break;
            }
            if(j==m)
                break;
        }
        return i==n ? -1 : i;
        
    }
    
    //KMP算法
    void MakeNext(string pattern, int *next)
    {
        int k=0;
        int m = pattern.length();
        next[0] = 0;
        int i=0;
        for(i=1; i<m; i++)
        {
            while(k>0&&pattern[i]!=pattern[k])
                k = next[k-1];
            if(pattern[i] == pattern[k])
                k++;
            next[i] = k;
          
        }
    }
    
    int strStr(string haystack, string needle) {
        if((haystack.empty()|| !haystack.empty())&&needle.empty())
            return 0;
        int n = haystack.length();
        int m = needle.length();
        int *next = new int[m];
        MakeNext(needle, next);
        int i,p;
        cout<<n<<"@"<<m<<endl;
        for(i=0,p=0;i<n; i++)
        {
         
            while(p>0&&haystack[i]!=needle[p])
                p = next[p-1];
            if(haystack[i]==needle[p])
                p++;
            if(p==m)
            {
                cout<<"pattern"<<endl;
                return i-m+1;
            }
        }
        cout<<i<<" "<<p<<endl;
        return -1;
    }

    
};