686. Repeated String Match 重复字符串匹配
Posted Long Long Journey
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了686. Repeated String Match 重复字符串匹配相关的知识,希望对你有一定的参考价值。
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,找到必须重复的最小次数,使得B是其子串。如果没有这样的解决方案,返回-1。
/**
* @param {string} A
* @param {string} B
* @return {number}
*/
var repeatedStringMatch = function (A, B) {
if (A.includes(B)) {
return 1;
}
let time = 1;
let isLonger = false;
while (isLonger == false) {
let res = A.repeat(++time);
if (res.includes(B)) {
return time;
}
if (res.length > B.length) {
isLonger = true;
}
}
return -1;
};
以上是关于686. Repeated String Match 重复字符串匹配的主要内容,如果未能解决你的问题,请参考以下文章
[leetcode-686-Repeated String Match]
686. Repeated String Match 重复字符串匹配