Class Solution
-
- All Implemented Interfaces:
public final class Solution30 - Substring with Concatenation of All Words.
Hard
You are given a string
sand an array of stringswords. All the strings ofwordsare of the same length.A concatenated substring in
sis a substring that contains all the strings of any permutation ofwordsconcatenated.For example, if
words = ["ab","cd","ef"], then"abcdef","abefcd","cdabef","cdefab","efabcd", and"efcdab"are all concatenated strings."acdbef"is not a concatenated substring because it is not the concatenation of any permutation ofwords.
Return the starting indices of all the concatenated substrings in
s. You can return the answer in any order.Example 1:
Input: s = "barfoothefoobarman", words = "foo","bar"
Output: 0,9
Explanation:
Since words.length == 2 and wordsi.length == 3, the concatenated substring has to be of length 6.
The substring starting at 0 is "barfoo". It is the concatenation of "bar","foo" which is a permutation of words.
The substring starting at 9 is "foobar". It is the concatenation of "foo","bar" which is a permutation of words.
The output order does not matter. Returning 9,0 is fine too.
Example 2:
Input: s = "wordgoodgoodgoodbestword", words = "word","good","best","word"
Output: []
Explanation:
Since words.length == 4 and wordsi.length == 4, the concatenated substring has to be of length 16.
There is no substring of length 16 is s that is equal to the concatenation of any permutation of words.
We return an empty array.
Example 3:
Input: s = "barfoofoobarthefoobarman", words = "bar","foo","the"
Output: 6,9,12
Explanation:
Since words.length == 3 and wordsi.length == 3, the concatenated substring has to be of length 9.
The substring starting at 6 is "foobarthe". It is the concatenation of "foo","bar","the" which is a permutation of words.
The substring starting at 9 is "barthefoo". It is the concatenation of "bar","the","foo" which is a permutation of words.
The substring starting at 12 is "thefoobar". It is the concatenation of "the","foo","bar" which is a permutation of words.
Constraints:
<code>1 <= s.length <= 10<sup>4</sup></code>
1 <= words.length <= 50001 <= words[i].length <= 30sandwords[i]consist of lowercase English letters.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-