2017年10月4日
686. Repeated String Match 重复字符串匹配
摘要： Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.For example, with A = "abcd" and B = "cdabcdab".Return... 阅读全文
posted @ 2017-10-04 23:09 xiejunzhao 阅读(208) 评论(0) 推荐(0)