leetcode面试准备: Substring with Concatenation of All Words

1 题目

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.

For example, given:

s: "barfoothefoobarman"

words: ["foo", "bar"]

You should return the indices: [0,9].

(order does not matter).

接口:public List<Integer> findSubstring(String s, String[] words)

2 思路

题意

找出可以连接成words里面单词的组合，输出子字符串的起始位置。

复杂度: Time