[leetcode] 686. Repeated String Match

Description

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，求字符串A最小重复多次，使得B是A的子集，如果没有，则返回-1.

• 如果B要能成为A的字符串，那么A的长度肯定要大于等于B，所以当A的长度小于B的时候，我们可以先进行重复A，直到A的长度大于等于B，并且累计次数cnt。那么此时我们用find来找，看B是否存在A中，如果存在直接返回cnt。如果不存在，我们再加上一个A，再来找，这样可以处理这种情况A=“abc”, B=“cab”，如果此时还找不到，说明无法匹配，返回-1

代码

class Solution {
public:
    int repeatedStringMatch(string A, string B) {
        int m=A.length();
        int n=B.length();
        int cnt=0;
        string s="";
        int i=0;
        while(i<n){
            i+=m;
            s+=A;
            cnt++;
        }
        if(s.find(B)!=string::npos) return cnt;
        s+=A;
        if(s.find(B)!=string::npos) return cnt+1;
        return -1;
    }
};

参考文献

[LeetCode] Repeated String Match 重复字符串匹配