Package g0601_0700.s0686_repeated_string_match

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    686 - Repeated String Match\.

    Medium

    Given two strings a and b, return the minimum number of times you should repeat string a so that string b is a substring of it. If it is impossible for b to be a substring of a after repeating it, return -1.

    Notice: string "abc" repeated 0 times is "", repeated 1 time is "abc" and repeated 2 times is "abcabc".

    Example 1:

    Input: a = "abcd", b = "cdabcdab"

    Output: 3

    Explanation: We return 3 because by repeating a three times "abcdabcdabcd", b is a substring of it.

    Example 2:

    Input: a = "a", b = "aa"

    Output: 2

    Constraints:

    • <code>1 <= a.length, b.length <= 10<sup>4</sup></code>

    • a and b consist of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer repeatedStringMatch(String a, String b)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait