Package g0401_0500.s0466_count_the_repetitions

Class Solution

java.lang.Object

g0401_0500.s0466_count_the_repetitions.Solution

public class Solution
extends java.lang.Object

466 - Count The Repetitions.

Hard

We define str = [s, n] as the string str which consists of the string s concatenated n times.

• For example, str == ["abc", 3] =="abcabcabc".

We define that string s1 can be obtained from string s2 if we can remove some characters from s2 such that it becomes s1.

• For example, s1 = "abc" can be obtained from s2 = "ab**dbe**c" based on our definition by removing the bolded underlined characters.

You are given two strings s1 and s2 and two integers n1 and n2. You have the two strings str1 = [s1, n1] and str2 = [s2, n2].

Return the maximum integer m such that str = [str2, m] can be obtained from str1.

Example 1:

Input: s1 = “acb”, n1 = 4, s2 = “ab”, n2 = 2

Output: 2

Example 2:

Input: s1 = “acb”, n1 = 1, s2 = “acb”, n2 = 1

Output: 1

Constraints:

• 1 <= s1.length, s2.length <= 100
• s1 and s2 consist of lowercase English letters.
• 1 <= n1, n2 <= 106

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	getMaxRepetitions(java.lang.String s1, int n1, java.lang.String s2, int n2)

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

getMaxRepetitions

public int getMaxRepetitions(java.lang.String s1,
 int n1,
 java.lang.String s2,
 int n2)