Leetcode——686. Repeated String Match

题目原址

https://leetcode.com/problems/repeated-string-match/description/

题目描述

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.

题目解析

这个题还是很简单的，题目要求就是想要得到A字符串经过一次一次的追加本身，是否追加的结果中包含字符串B。因为想到追加字符串，第一个想到的就是StringBuilder类，因为有append方法呀。题目最后想要返回追加的次数，如果不管追加几次最后字符串B都不是A的子串，则返回-1，否则返回次数。因此思路就是每次追加都用变量count自加一次。
那什么时候回出现不管追加几次都不符合题意呢？我觉得就是当初始的时候字符串A长度大于B，并且在追加A之后，不满足字符串B是A的子串就会不满足题意。

AC代码

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

        }
        return count;
    }
}