LeetCode | 28. Find the Index of the First Occurrence in a String, 459. Repeated Substring Pattern

最新推荐文章于 2024-10-13 15:10:00 发布

weixin_43615320

最新推荐文章于 2024-10-13 15:10:00 发布

阅读量50

点赞数

文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_43615320/article/details/131821102

版权

文章介绍了如何使用KMP算法来解决两个字符串问题：一是找到给定字符串中指定子串的首次出现索引，二是判断一个字符串是否能通过自身的子串重复连接形成。KMP算法在处理这类问题时避免了多余的比较，提高了效率。

摘要由CSDN通过智能技术生成

28. Find the Index of the First Occurrence in a String

Link: https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/

Description

Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Approach

KMP

Link: https://programmercarl.com/0028.%E5%AE%9E%E7%8E%B0strStr.html

Solution

class Solution {
    public int strStr(String haystack, String needle) {
        if (needle.length() == 0)
            return 0;
        int[] next = new int[needle.length()];
        getNext(needle, next);
        int j = -1;
        for (int i = 0; i < haystack.length(); i++) {
            while (j >= 0 && haystack.charAt(i) != needle.charAt(j + 1))
                j = next[j];
            if (haystack.charAt(i) == needle.charAt(j + 1))
                j++;
            if (j == needle.length() - 1)
                return i - (needle.length() - 1);
        }
        return -1;
    }

    private void getNext(String s, int[] next) {
        int j = -1;
        next[0] = -1;
        for (int i = 1; i < s.length(); i++) {
            while (j >= 0 && s.charAt(i) != s.charAt(j + 1))
                j = next[j];
            if (s.charAt(i) == s.charAt(j + 1))
                j++;
            next[i] = j;
        }
    }
}

459. Repeated Substring Pattern

Link: https://leetcode.com/problems/repeated-substring-pattern/

Description

Given a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.

Approach

KMP

Link: https://programmercarl.com/0459.%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.html

移动匹配

Link: https://programmercarl.com/0459.%E9%87%8D%E5%A4%8D%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2.html

Solution

class Solution {
    public boolean repeatedSubstringPattern(String s) {
        String s2 = s + s;
        String s1 = s2.substring(1, s2.length() - 1);
        System.out.println(s1);
        if (s1.contains(s))
            return true;
        else 
            return false;
    }
}

class Solution {
    public boolean repeatedSubstringPattern(String s) {
        if (s.length() == 0)
            return false;
        int[] next = new int[s.length()];
        getNext(s, next);
        for (int i: next)
            System.out.println(i);
        if (next[s.length() - 1] >= 0 && s.length() % (s.length() - (next[s.length() - 1] + 1)) == 0)
            return true;
        else
            return false;
    }

    private void getNext(String s, int[] next) {
        int j = -1;
        next[0] = -1;
        for (int i = 1; i < s.length(); i++) {
            while (j >= 0 && s.charAt(i) != s.charAt(j + 1))
                j = next[j];
            if (s.charAt(i) == s.charAt(j + 1))
                j++;
            next[i] = j;
        }
    }
}