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").
题意:给了两个字符串A、B,问重复多少A次后得到的字符串S,使B是S的一个子串?无法得到字符串返回-1
分情况讨论:
len1 = A.length
len2 = B.length
当len1 >= len2:如果 B 不是 A 或者 A + A 的子串,则返回 -1
当len1 < len2, c是满足重复c次A,得到字符串长度大于等于B,
c可以这样计算c = (len2 + len1 - 1) / len1
判断B是否是 cA或(c+1)A的子串 (题目的样例就是c+1的情况)
具体看代码吧
/**
* Created by dezhonger on 2019/7/16
*/
public class Leetcode0686 {
public int repeatedStringMatch(String A, String B) {
int len1 = A.length();
int len2 = B.length();
String A2 = A + A;
if (len1 >= len2) {
if (A.contains(B)) return 1;
else if (A2.contains(B)) return 2;
return -1;
} else {
int c = (len2 + len1 - 1) / len1;
StringBuilder AA = new StringBuilder();
for (int i = 0; i < c; i++) AA.append(A);
if (AA.toString().contains(B)) return c;
else if ((AA.toString() + A).contains(B)) return c + 1;
else return -1;
}
}
}