feat: add solutions to lc problem: No.0686

No.0686.Repeated String Match

Author: yanglbme

solution/0600-0699/0686.Repeated String Match/README.md

@@ -47,27 +47,91 @@
 	<li><code>a</code> 和 <code>b</code> 由小写英文字母组成</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+新串由 a 通过重复最小 ans 次得来，假设新串包含子字符串 b，那么新串的起始匹配位置一定不超过 a。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def repeatedStringMatch(self, a: str, b: str) -> int:
+        m, n = len(a), len(b)
+        ans = ceil(n / m)
+        t = [a] * ans
+        for _ in range(3):
+            if b in ''.join(t):
+                return ans
+            ans += 1
+            t.append(a)
+        return -1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int repeatedStringMatch(String a, String b) {
+        int m = a.length(), n = b.length();
+        int ans = (n + m - 1) / m;
+        StringBuilder t = new StringBuilder(a.repeat(ans));
+        for (int i = 0; i < 3; ++i) {
+            if (t.toString().contains(b)) {
+                return ans;
+            }
+            ++ans;
+            t.append(a);
+        }
+        return -1;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int repeatedStringMatch(string a, string b) {
+        int m = a.size(), n = b.size();
+        int ans = (n + m - 1) / m;
+        string t = "";
+        for (int i = 0; i < ans; ++i) t += a;
+        for (int i = 0; i < 3; ++i)
+        {
+            if (t.find(b) != -1) return ans;
+            ++ans;
+            t += a;
+        }
+        return -1;
+    }
+};
+```
 
+### **Go**
+
+```go
+func repeatedStringMatch(a string, b string) int {
+	m, n := len(a), len(b)
+	ans := (n + m - 1) / m
+	t := strings.Repeat(a, ans)
+	for i := 0; i < 3; i++ {
+		if strings.Contains(t, b) {
+			return ans
+		}
+		ans++
+		t += a
+	}
+	return -1
+}
 ```
 
 ### **...**

solution/0600-0699/0686.Repeated String Match/README_EN.md

@@ -47,21 +47,83 @@
 	<li><code>a</code>&nbsp;and&nbsp;<code>b</code>&nbsp;consist of lower-case English letters.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def repeatedStringMatch(self, a: str, b: str) -> int:
+        m, n = len(a), len(b)
+        ans = ceil(n / m)
+        t = [a] * ans
+        for _ in range(3):
+            if b in ''.join(t):
+                return ans
+            ans += 1
+            t.append(a)
+        return -1
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int repeatedStringMatch(String a, String b) {
+        int m = a.length(), n = b.length();
+        int ans = (n + m - 1) / m;
+        StringBuilder t = new StringBuilder(a.repeat(ans));
+        for (int i = 0; i < 3; ++i) {
+            if (t.toString().contains(b)) {
+                return ans;
+            }
+            ++ans;
+            t.append(a);
+        }
+        return -1;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int repeatedStringMatch(string a, string b) {
+        int m = a.size(), n = b.size();
+        int ans = (n + m - 1) / m;
+        string t = "";
+        for (int i = 0; i < ans; ++i) t += a;
+        for (int i = 0; i < 3; ++i)
+        {
+            if (t.find(b) != -1) return ans;
+            ++ans;
+            t += a;
+        }
+        return -1;
+    }
+};
+```
 
+### **Go**
+
+```go
+func repeatedStringMatch(a string, b string) int {
+	m, n := len(a), len(b)
+	ans := (n + m - 1) / m
+	t := strings.Repeat(a, ans)
+	for i := 0; i < 3; i++ {
+		if strings.Contains(t, b) {
+			return ans
+		}
+		ans++
+		t += a
+	}
+	return -1
+}
 ```
 
 ### **...**

solution/0600-0699/0686.Repeated String Match/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int repeatedStringMatch(string a, string b) {
+        int m = a.size(), n = b.size();
+        int ans = (n + m - 1) / m;
+        string t = "";
+        for (int i = 0; i < ans; ++i) t += a;
+        for (int i = 0; i < 3; ++i)
+        {
+            if (t.find(b) != -1) return ans;
+            ++ans;
+            t += a;
+        }
+        return -1;
+    }
+};

solution/0600-0699/0686.Repeated String Match/Solution.go

@@ -0,0 +1,13 @@
+func repeatedStringMatch(a string, b string) int {
+	m, n := len(a), len(b)
+	ans := (n + m - 1) / m
+	t := strings.Repeat(a, ans)
+	for i := 0; i < 3; i++ {
+		if strings.Contains(t, b) {
+			return ans
+		}
+		ans++
+		t += a
+	}
+	return -1
+}

solution/0600-0699/0686.Repeated String Match/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int repeatedStringMatch(String a, String b) {
+        int m = a.length(), n = b.length();
+        int ans = (n + m - 1) / m;
+        StringBuilder t = new StringBuilder(a.repeat(ans));
+        for (int i = 0; i < 3; ++i) {
+            if (t.toString().contains(b)) {
+                return ans;
+            }
+            ++ans;
+            t.append(a);
+        }
+        return -1;
+    }
+}

solution/0600-0699/0686.Repeated String Match/Solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def repeatedStringMatch(self, a: str, b: str) -> int:
+        m, n = len(a), len(b)
+        ans = ceil(n / m)
+        t = [a] * ans
+        for _ in range(3):
+            if b in ''.join(t):
+                return ans
+            ans += 1
+            t.append(a)
+        return -1