[Leetcode] 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.

思路：

暴力搜索即可。不过这里需要特别解释的是为什么循环中rep的最大值需要取B.length() / A.length() + 2。我们举个例子就可以看出来：假如A = “abc”，B = "cabca"，那么B.length() / A.length() = 5 / 3 = 1，但是显然A需要额外再多复制2次才可以使得B成为A的子串。

通常寻找子串的时间复杂度是O(mn)，其中m和n分别是子串和母串的长度。但是KMP算法可以使得时间复杂度降低到O(m+n)。我们这里偷懒采用stl中string的find函数实现子串的查找。

代码：

class Solution {
public:
    int repeatedStringMatch(string A, string B) {
        int lenA = A.length(), lenB = B.length();
        int min_count = lenB / lenA;
        string repeat_A;
        for (int i = 0; i < min_count; ++i) {
            repeat_A += A;
        }
        for (int i = min_count; i <= min_count + 2; ++i) {
            if (repeat_A.find(B) != string::npos) {
                return i;
            }
            repeat_A += A;
        }
        return -1;
    }
};