创建页面，内容为“Array/String: * 1768. Merge Strings Alternately: use StringBuilder * 1071. Greatest Common Divisor of Strings: if str1 and str2 can be divided, then <math> str1 + str2 = str2 + str1 \gcd(a,b)=\gcd(b,a \bmod b) </math> just get the substring of gcd length” |
小无编辑摘要 |
||
| 第2行： | 第2行： | ||
* 1768. Merge Strings Alternately: use StringBuilder | * 1768. Merge Strings Alternately: use StringBuilder | ||
* 1071. Greatest Common Divisor of Strings: | * 1071. Greatest Common Divisor of Strings: if str1 and str2 can be divided, then | ||
if str1 and str2 can be divided, then | |||
<math> | <math> | ||
str1 + str2 = str2 + str1 | str1 + str2 = str2 + str1 | ||
2026年3月24日 (二) 15:13的版本
Array/String:
- 1768. Merge Strings Alternately: use StringBuilder
- 1071. Greatest Common Divisor of Strings: if str1 and str2 can be divided, then
[math]\displaystyle{ str1 + str2 = str2 + str1 \gcd(a,b)=\gcd(b,a \bmod b) }[/math] just get the substring of gcd length