Substring with Concatenation of All Words
摘要：
You are given a string,S, and a list of words,L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.For example, given:S:"barfoothefoobarman"L:["foo", " 阅读全文
posted @ 2013-11-02 05:46 Step-BY-Step 阅读(161) 评论(0) 推荐(0) 编辑
