466. Count The Repetitions

Description

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 = "abdbec" 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

 

Solutions

Solution: Sliding Window

• Time complexity: O(n1*s1.length)
• Space complexity: O(1)

 

JavaScript

/**
 * @param {string} s1
 * @param {number} n1
 * @param {string} s2
 * @param {number} n2
 * @return {number}
 */
const getMaxRepetitions = function (s1, n1, s2, n2) {
  const n = s1.length;
  const m = s2.length;
  let current = 0;
  let repeatS1 = 0;
  let repeatS2 = 0;

  while (repeatS1 < n1) {
    for (let index = 0; index < n; index++) {
      if (s2[current] !== s1[index]) continue;
      current += 1;
      if (current !== m) continue;
      current = 0;
      repeatS2 += 1;
    }
    repeatS1 += 1;
    if (!current) break;
  }
  return Math.floor(((repeatS2 / n2) * n1) / repeatS1);
};