2017年5月9日
Leetcode: 30. Substring with Concatenation of All Words
摘要： You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters. 阅读全文
posted @ 2017-05-09 21:02 JeffNice 阅读(161) 评论(0) 推荐(0)