686 Repeated String Match

最新推荐文章于 2023-10-14 20:31:28 发布

dongbeier

最新推荐文章于 2023-10-14 20:31:28 发布

阅读量142

点赞数

CC 4.0 BY-SA版权

分类专栏： Google LeetCode

本文链接：https://blog.csdn.net/dongbeier/article/details/80873427

LeetCode 同时被 2 个专栏收录

146 篇文章

订阅专栏

Google

21 篇文章

订阅专栏

本文介绍了一个字符串处理问题：如何确定字符串A需要重复多少次才能使字符串B成为其子串。通过构建并逐步扩展一个字符串来检查B是否为该扩展字符串的子串，从而找到最小的重复次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.

For example, with A = "abcd" and B = "cdabcdab".

Return 3, because by repeating A three times (“abcdabcdabcd”), B is a substring of it; and B is not a substring of A repeated two times ("abcdabcd").

Note:
The length of A and B will be between 1 and 10000.

建立一个sb, 一直往后添加A直到长度大于或者等于B. 然后判断是否包含B.

class Solution {
    public int repeatedStringMatch(String A, String B) {
        int count = 0;
        StringBuilder sb = new StringBuilder();
        while (sb.length() < B.length()) {
            sb.append(A);
            count++;
        }
        if (sb.toString().contains(B)) {
            return count;
        }
        if (sb.append(A).toString().contains(B)) {
            return ++count;
        }
        return -1;
    }
}