Leetcode算法学习日志-686 Repeated String Match

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.

题意分析

给定一个stringB，求问A重复多少次能使得B是他的子字符串，如果不行返回-1.

解法分析

首先需要将A复制多次得到Ad，使得Ad刚好比B长，此时如果能够在Ad中找到字串B，则返回重复次数，如果不能则最多再加上一个A，再来用find函数查找B，a.find(b,pos,n)在a中查找string b，起始点为pos。：

class Solution {
public:
    int repeatedStringMatch(string a, string b) {
        string as = a;
        for (int rep = 1; rep <= b.length() / a.length() + 2; rep++, as += a)
            if (as.find(b) != string::npos) return rep;
        return -1;
    }
};