题目描述

给定一个字符串 s 和一些长度相同的单词 words。在 s 中找出可以恰好串联 words 中所有单词的子串的起始位置。

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.Example 1:Input:s = "barfoothefoobarman",words = ["foo","bar"]
Output: [0,9]
Explanation: Substrings starting at index 0 and 9 are "barfoor" and "foobar" respectively.
The output order does not matter, returning [9,0] is fine too.Example 2:Input:s = "wordgoodstudentgoodword",words = ["word","student"]
Output: []

题目链接

解题代码

from collections import defaultdictclass Solution:def findSubstring(self, s, words):""":type s: str:type words: List[str]:rtype: List[int]"""res = []if len(words) == 0 or len(s) < len(words[0]) * len(words):return resstr_len = len(s)word_len = len(words[0])total_len = len(words) * word_lenmap_dict = defaultdict(int)cur_dict = defaultdict(int)for word in words:map_dict[word] += 1for start in range(0, str_len - total_len + 1):end = startwhile end < start + total_len:substr = s[end: end + word_len]cur_dict[substr] += 1# 如果当前dict中还有之前的没有的，或者值比至之前的大都终止if cur_dict[substr] > map_dict[substr]:breakend += word_lenif end == start + total_len:res.append(start)cur_dict.clear()return res

主要还是用滑动窗口法解决问题，有关滑动窗口法的详解，请看这里
完整源码在这里

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串滑动窗口法相关推荐

030 Substring with Concatenation of All Words 与所有单词相关联的字串
给定一个字符串 s 和一些长度相同的单词 words,找出 s 与 words 中所有单词(words 每个单词只出现一次)串联一起(words中组成串联串的单词的顺序随意)的字符串匹配的所有起始索引 ...
LeetCode（30）：与所有单词相关联的字串
Hard! 题目描述: 给定一个字符串 s 和一些长度相同的单词 words.在 s 中找出可以恰好串联 words 中所有单词的子串的起始位置. 注意子串要与 words 中的单词完全匹配,中间不能 ...
LeetCode 30. Substring with Concatenation of All Words
LeetCode 30. Substring with Concatenation of All Words Solution1: 转载自:http://www.cnblogs.com/grandya ...
**LeetCode 30. Substring with Concatenation of All Words
https://leetcode.com/problems/substring-with-concatenation-of-all-words/ 滑动窗口法.解析看这里: http://www.2ct ...
[剑指offer]面试题第[48]题[Leetcode][JAVA][第3题][无重复字符的最长字串][滑动窗口][HashSet/Map]
[问题描述][第3题][无重复字符的最长字串] 给定一个字符串,请你找出其中不含有重复字符的最长子串的长度.示例 1:输入: "abcabcbb" 输出: 3 解释: 因为无重 ...
LeetCode 3.无重复字符的最长字串(滑动窗口)
题目描述给定一个字符串,请你找出其中不含有重复字符的最长子串的长度. 示例 1: 输入: "abcabcbb" 输出: 3 解释: 因为无重复字符的最长子串是 "a ...
leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法
题目解析代码如下题目解析这一题是一道会员的题目,题目介绍如下: Given a string, find the length of the longest substring T that c ...
leetcode 3. Longest Substring Without Repeating Characters 最长非重复子串的长度滑动窗口法
题目链接根据我们之前介绍的滑动窗口法的解法: 滑动窗口法详解 leetcode 438. Find All Anagrams in a String 滑动窗口法这题,我们不难解决,使用之前的模板. ...
【LeetCode】无重复字符的最长子串【滑动窗口法】
给定一个字符串,请你找出其中不含有重复字符的最长子串的长度. 示例 1: 输入: "abcabcbb" 输出: 3 解释: 因为无重复字符的最长子串是 "abc&qu ...

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串滑动窗口法

题目描述

解题代码

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串滑动窗口法相关推荐

最新文章

热门文章

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串 滑动窗口法

题目描述

解题代码

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串 滑动窗口法相关推荐

最新文章

热门文章

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串滑动窗口法

leetcode 30. Substring with Concatenation of All Words 与所有单词相关联的字串滑动窗口法相关推荐