686_repeated_string_match.py

class Solution:
    def repeatedStringMatch(self, A: str, B: str) -> int:
        length_A = len(A)
        length_B = len(B)
        repeated_times = 0
        if length_B % length_A == 0:
            repeated_times = length_B // length_A
        else:
            repeated_times = length_B // length_A + 1
        if B in (A * repeated_times):
            return repeated_times
        elif B in (A * (repeated_times+1)):
            return repeated_times + 1
        else:
            return -1

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''