该博客详细介绍了LeetCode第30题的解决方案，通过滑动窗口策略寻找给定字符串中包含所有单词任意排列组合的子串，并解释了如何使用hash table记录单词出现次数，以及如何判断是否找到符合条件的子串。
LeetCode 30. Substring with Concatenation of All Words
| 考点 | 难度 |
|---|---|
| Hash Table | Hard |
题目
You are given a string s and an array of strings words. All the strings of words are of the same length.
A concatenated substring in s is a substring that contains all the strings of any permutation of words concatenated.
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 of words.
Return the starting indices of all the concatenated substrings in s. You can return the answer in any order.
最低0.47元/天 解锁文章
281
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
