代码随想录刷题第9天

代码随想录刷题第9天

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

/*
 * @lc app=leetcode.cn id=28 lang=cpp
 *
 * [28] 找出字符串中第一个匹配项的下标
 */

// @lc code=start
#include <iostream>
#include <string>
using namespace std;
class Solution {
public:

    void getNext(int * next,string &s){
        int j = -1;
        next[0] = j;
        for (int i = 1; i < s.size(); i++)
        {
            while (j >= 0 && s[i] != s[j+1])
            {
                j = next[j];
            }

            if(s[i] == s[j+1]){
                j++;
            }
            next[i] = j;
        }
        
    }

    int strStr(string haystack, string needle) {
        if (needle.size() == 0)
        {
            return 0;
        }
        
        int n = needle.size();
        int next[n];
        getNext(next,needle);
        int j = -1;
        for (int i = 0; i < haystack.size(); i++)
        {
            while (j >= 0 && haystack[i] != needle[j+1])
            {
                j = next[j];
            }
            
            if (haystack[i] == needle[j+1])
            {
                j++;
            }
            
            if (j == needle.size()-1)
            {
                int result = i - needle.size() + 1;
                return result;
            }
            

        }
        return -1;
    }
};
// @lc code=end

next数组的计算要看懂，第二次的字符匹配上从下标0开始的！！！

重复的子字符串

/*
 * @lc app=leetcode.cn id=459 lang=cpp
 *
 * [459] 重复的子字符串
 */

// @lc code=start
#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
    void getNext(int *next,string &s){
        int j = -1;
        next[0] = -1;
        for (int i = 1; i < s.size(); i++)
        {
            while (j >= 0 && s[i] != s[j+1])
            {
                j = next[j];
            }

            if (s[j+1] == s[i])
            {
                j++;
            }
            
            next[i] = j;
        }
    }

    bool repeatedSubstringPattern(string s) {
        if (!s.size())
        {
            return false;
        }
        
        int next[s.size()];
        getNext(next,s);
        int len = s.size();
        if (next[len-1] != -1 && len % (len - next[len-1] -1) == 0)
        {
            return true;
        }
        return false;
    }
};
// @lc code=end