[LeetCode] 686. Repeated String Match
文章目录
Problem
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.
Solution
class Solution {
public int repeatedStringMatch(String A, String B) {
if (A.length() == 0 || B.length() == 0) return -1;
StringBuilder sb = new StringBuilder();
int count = 0;
while (sb.length() < B.length()) {
sb.append(A);
count++;
}
if (sb.toString().indexOf(B) != -1) return count;
if (sb.append(A).toString().contains(B)) return count+1;
return -1;
}
}

评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论