31 January Minimum times A has to be repeated such that B is a substring of it

class Solution { 
  public: 
    int minRepeats(string A, string B) { 
        string s = A; 
        int moves = 1; 
        while (A.size() < B.size()){ 
            A += s; 
            moves++; 
        } 
        if (A.find(B) != -1){ 
            return moves; 
        } 
        A += s; 
        moves++; 
        if (A.find(B) != -1){ 
            return moves; 
        } 
        return -1; 
    } 
};