2013年2月13日
leetcode 71: Substring with Concatenation of All Words
摘要： Substring with Concatenation of All WordsFeb 24 '12You 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:& 阅读全文
posted @ 2013-02-13 05:14 西施豆腐渣 阅读(134) 评论(0) 推荐(0)