2019年9月19日
(Easy)1071. Greatest Common Divisor of Strings- LeetCode
摘要： Description: For strings S and T, we say "T divides S" if and only if S = T + ... + T (T concatenated with itself 1 or more times) Return the largest 阅读全文
posted @ 2019-09-19 18:06 CodingYM 阅读(464) 评论(0) 推荐(0) 编辑