686. Repeated String Match（python+cpp）

题目：

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.

解释：
python代码：

from math import ceil
class Solution(object):
    def repeatedStringMatch(self, A, B):
        """
        :type A: str
        :type B: str
        :rtype: int
        """
        m=int(ceil(len(B)/float(len(A))))
        n=m+1
        if B in A*m:
            return m
        elif B in A*n:
            return n
        return -1

c++代码：

#include <cmath>
using namespace std;
class Solution {
public:
    int repeatedStringMatch(string A, string B) {
        int m=ceil(B.size()/(float)A.size())+1;
        string tmp=A;
        for (int i=0;i<=m;i++)
        {   
            if(tmp.find(B)!=string::npos)
                return i+1;
            tmp+=A;
        }
        return -1;      
    }
};

总结：
要用到向上取整