+ problem 466

Author: fruit-in

Problemset/0466-Count The Repetitions/README.md

@@ -0,0 +1,71 @@
+# 466. Count The Repetitions
+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:
+<pre>
+<strong>Input:</strong> s1 = "acb", n1 = 4, s2 = "ab", n2 = 2
+<strong>Output:</strong> 2
+</pre>
+
+#### Example 2:
+<pre>
+<strong>Input:</strong> s1 = "acb", n1 = 1, s2 = "acb", n2 = 1
+<strong>Output:</strong> 1
+</pre>
+
+#### Constraints:
+* `1 <= s1.length, s2.length <= 100`
+* `s1` and `s2` consist of lowercase English letters.
+* <code>1 <= n1, n2 <= 10<sup>6</sup></code>
+
+## Solutions (Rust)
+
+### 1. Solution
+```Rust
+use std::collections::HashMap;
+
+impl Solution {
+ pub fn get_max_repetitions(s1: String, n1: i32, s2: String, n2: i32) -> i32 {
+ let s1 = s1.as_bytes();
+ let s2 = s2.as_bytes();
+ let mut i = 0;
+ let mut memo = HashMap::new();
+ let mut count2 = 0;
+
+ for _ in 0..n1 {
+ if let Some(&(count, j)) = memo.get(&i) {
+ count2 += count;
+ i = j;
+ continue;
+ }
+
+ let init = i;
+ let mut count = 0;
+
+ for j in 0..s1.len() {
+ if s1[j] == s2[i] {
+ i = (i + 1) % s2.len();
+ if i == 0 {
+ count += 1;
+ }
+ }
+ }
+
+ memo.insert(init, (count, i));
+ count2 += count;
+ }
+
+ count2 / n2
+ }
+}
+```

Problemset/0466-Count The Repetitions/README_CN.md

@@ -0,0 +1,71 @@
+# 466. 统计重复个数
+定义 `str = [s, n]` 表示 `str` 由 `n` 个字符串 `s` 连接构成。
+
+* 例如，`str == ["abc", 3] =="abcabcabc"` 。
+
+如果可以从 `s2` 中删除某些字符使其变为 `s1`，则称字符串 `s1` 可以从字符串 `s2` 获得。
+
+* 例如，根据定义，`s1 = "abc"` 可以从 `s2 = "abdbec"` 获得，仅需要删除加粗且用斜体标识的字符。
+
+现在给你两个字符串 `s1` 和 `s2` 和两个整数 `n1` 和 `n2` 。由此构造得到两个字符串，其中 `str1 = [s1, n1]`、`str2 = [s2, n2]` 。
+
+请你找出一个最大整数 `m` ，以满足 `str = [str2, m]` 可以从 `str1` 获得。
+
+#### 示例 1:
+<pre>
+<strong>输入:</strong> s1 = "acb", n1 = 4, s2 = "ab", n2 = 2
+<strong>输出:</strong> 2
+</pre>
+
+#### 示例 2:
+<pre>
+<strong>输入:</strong> s1 = "acb", n1 = 1, s2 = "acb", n2 = 1
+<strong>输出:</strong> 1
+</pre>
+
+#### 提示:
+* `1 <= s1.length, s2.length <= 100`
+* `s1` 和 `s2` 由小写英文字母组成
+* <code>1 <= n1, n2 <= 10<sup>6</sup></code>
+
+## 题解 (Rust)
+
+### 1. 题解
+```Rust
+use std::collections::HashMap;
+
+impl Solution {
+ pub fn get_max_repetitions(s1: String, n1: i32, s2: String, n2: i32) -> i32 {
+ let s1 = s1.as_bytes();
+ let s2 = s2.as_bytes();
+ let mut i = 0;
+ let mut memo = HashMap::new();
+ let mut count2 = 0;
+
+ for _ in 0..n1 {
+ if let Some(&(count, j)) = memo.get(&i) {
+ count2 += count;
+ i = j;
+ continue;
+ }
+
+ let init = i;
+ let mut count = 0;
+
+ for j in 0..s1.len() {
+ if s1[j] == s2[i] {
+ i = (i + 1) % s2.len();
+ if i == 0 {
+ count += 1;
+ }
+ }
+ }
+
+ memo.insert(init, (count, i));
+ count2 += count;
+ }
+
+ count2 / n2
+ }
+}
+```

Problemset/0466-Count The Repetitions/Solution.rs

@@ -0,0 +1,36 @@
+use std::collections::HashMap;
+
+impl Solution {
+ pub fn get_max_repetitions(s1: String, n1: i32, s2: String, n2: i32) -> i32 {
+ let s1 = s1.as_bytes();
+ let s2 = s2.as_bytes();
+ let mut i = 0;
+ let mut memo = HashMap::new();
+ let mut count2 = 0;
+
+ for _ in 0..n1 {
+ if let Some(&(count, j)) = memo.get(&i) {
+ count2 += count;
+ i = j;
+ continue;
+ }
+
+ let init = i;
+ let mut count = 0;
+
+ for j in 0..s1.len() {
+ if s1[j] == s2[i] {
+ i = (i + 1) % s2.len();
+ if i == 0 {
+ count += 1;
+ }
+ }
+ }
+
+ memo.insert(init, (count, i));
+ count2 += count;
+ }
+
+ count2 / n2
+ }
+}

README.md

@@ -355,6 +355,7 @@
 [462][462l] |[Minimum Moves to Equal Array Elements II][462] |![rs]
 [463][463l] |[Island Perimeter][463] |![rs]
 [464][464l] |[Can I Win][464] |![py]
+[466][466l] |[Count The Repetitions][466] |![rs]
 [467][467l] |[Unique Substrings in Wraparound String][467] |![rb]  ![rs]
 [468][468l] |[Validate IP Address][468] |![rs]
 [470][470l] |[Implement Rand10() Using Rand7()][470] |![rs]
@@ -2297,6 +2298,7 @@
 [462]:Problemset/0462-Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md#462-minimum-moves-to-equal-array-elements-ii
 [463]:Problemset/0463-Island%20Perimeter/README.md#463-island-perimeter
 [464]:Problemset/0464-Can%20I%20Win/README.md#464-can-i-win
+[466]:Problemset/0466-Count%20The%20Repetitions/README.md#466-count-the-repetitions
 [467]:Problemset/0467-Unique%20Substrings%20in%20Wraparound%20String/README.md#467-unique-substrings-in-wraparound-string
 [468]:Problemset/0468-Validate%20IP%20Address/README.md#468-validate-ip-address
 [470]:Problemset/0470-Implement%20Rand10\(\)%20Using%20Rand7\(\)/README.md#470-implement-rand10-using-rand7
@@ -4233,6 +4235,7 @@
 [462l]:https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/
 [463l]:https://leetcode.com/problems/island-perimeter/
 [464l]:https://leetcode.com/problems/can-i-win/
+[466l]:https://leetcode.com/problems/count-the-repetitions/
 [467l]:https://leetcode.com/problems/unique-substrings-in-wraparound-string/
 [468l]:https://leetcode.com/problems/validate-ip-address/
 [470l]:https://leetcode.com/problems/implement-rand10-using-rand7/

README_CN.md

@@ -355,6 +355,7 @@
 [462][462l] |[最少移动次数使数组元素相等 II][462] |![rs]
 [463][463l] |[岛屿的周长][463] |![rs]
 [464][464l] |[我能赢吗][464] |![py]
+[466][466l] |[统计重复个数][466] |![rs]
 [467][467l] |[环绕字符串中唯一的子字符串][467] |![rb]  ![rs]
 [468][468l] |[验证IP地址][468] |![rs]
 [470][470l] |[用 Rand7() 实现 Rand10()][470] |![rs]
@@ -2297,6 +2298,7 @@
 [462]:Problemset/0462-Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README_CN.md#462-最少移动次数使数组元素相等-ii
 [463]:Problemset/0463-Island%20Perimeter/README_CN.md#463-岛屿的周长
 [464]:Problemset/0464-Can%20I%20Win/README_CN.md#464-我能赢吗
+[466]:Problemset/0466-Count%20The%20Repetitions/README_CN.md#466-统计重复个数
 [467]:Problemset/0467-Unique%20Substrings%20in%20Wraparound%20String/README_CN.md#467-环绕字符串中唯一的子字符串
 [468]:Problemset/0468-Validate%20IP%20Address/README_CN.md#468-验证ip地址
 [470]:Problemset/0470-Implement%20Rand10\(\)%20Using%20Rand7\(\)/README_CN.md#470-用-Rand7-实现-Rand10
@@ -4233,6 +4235,7 @@
 [462l]:https://leetcode.cn/problems/minimum-moves-to-equal-array-elements-ii/
 [463l]:https://leetcode.cn/problems/island-perimeter/
 [464l]:https://leetcode.cn/problems/can-i-win/
+[466l]:https://leetcode.cn/problems/count-the-repetitions/
 [467l]:https://leetcode.cn/problems/unique-substrings-in-wraparound-string/
 [468l]:https://leetcode.cn/problems/validate-ip-address/
 [470l]:https://leetcode.cn/problems/implement-rand10-using-rand7/