LeetCode KMP相关的题目

最新推荐文章于 2024-02-09 15:37:26 发布

Hanknet

最新推荐文章于 2024-02-09 15:37:26 发布

阅读量110

点赞数

文章标签： leetcode 算法数据结构

本文链接：https://blog.csdn.net/hanknet/article/details/130139279

版权

28. 找出字符串中第一个匹配项的下标

方法：KMP

next数组不减一

class Solution {
private:
    void getnext(int* next, const string& s) {
        int j = 0;
        next[0] = j;
        for (int i = 1; i < s.size(); ++i) {
            while (j > 0 && s[i] != s[j]) j = next[j-1];
            if (s[i] == s[j]) ++j;
            next[i] = j;
        }
    }
public:
    int strStr(string haystack, string needle) {
        int n = haystack.size(), m = needle.size();
        int next[m];
        getnext(next, needle);
        int j = 0;
        for (int i = 0; i < n; ++i) {
            while (j > 0 && haystack[i] != needle[j]) j = next[j-1];
            if (haystack[i] == needle[j]) ++j;
            if (j == m) return i - m + 1; 
        }
        return -1;
    }
};

next数组统一减一

class Solution {
private:
    void getNext(int* next, string& s) {
        int j = 0;
        next[0] = j;
        for(int i = 1; i < s.size(); ++i) {
            while(j > 0 && s[i] != s[j]) j = next[j-1];
            if(s[i] == s[j]) ++j;
            next[i] = j;
        }
    }
public:
    int strStr(string haystack, string needle) {
        if(needle.size() == 0) return 0;
        int next[needle.size()];
        getNext(next, needle);
        int j = 0; 
        for(int i = 0; i < haystack.size(); ++i) {
            while(j > 0 && haystack[i] != needle[j]) j = next[j-1];
            if(haystack[i] == needle[j]) ++j;
            if(j == needle.size()) return (i-needle.size()+1);
        }
        return -1;
    }
};

$时间复杂度O(n),空间复杂度O(n)

459. 重复的子字符串

方法：KMP

class Solution {
private:
    void getnext(int* next, const string& s) {
        int j = 0;
        next[0] = j;
        for (int i = 1; i < s.size(); ++i) {
            while (j > 0 && s[i] != s[j]) j = next[j-1];
            if (s[i] == s[j]) ++j;
            next[i] = j;
        }
    }
public:
    bool repeatedSubstringPattern(string s) {
        int n = s.size();
        int next[n];
        getnext(next, s);
        if (next[n-1] != 0 && n % (n-next[n-1]) == 0) return true;
        return false;
    }
};

$时间复杂度O(n),空间复杂度O(n)