2017年10月6日
[LeetCode] 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 阅读全文
posted @ 2017-10-06 13:21 Grandyang 阅读(9601) 评论(2) 推荐(0) 编辑
Fork me on GitHub