2017年10月17日
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 阅读全文
posted @ 2017-10-17 19:35 __Meng 阅读(208) 评论(0) 推荐(0) 编辑