LeetCode-30 Substring with Concatenation of All Words

Description

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

Example 1:
Input:
s = “barfoothefoobarman”,
words = [“foo”,“bar”]
Output: [0,9]
Explanation: Substrings starting at index 0 and 9 are “barfoo” and “foobar” respectively.
The output order does not matter, returning [9,0] is fine too.

Example 2:
Input:
s = “wordgoodgoodgoodbestword”,
words = [“word”,“good”,“best”,“word”]
Output: []

Submissions

我的解题思路是首先计算words列表中每个单词的长度及单词个数,并将words排序,如果words为空或者长度大于s,则直接返回空。否则遍历s减去words长度的前几个字符,去匹配其中的单词,匹配到时就将单词添加到res列表中,最后将res排序并比较是否和排序的words相同,若相同,则将当前索引i添加到列表l中。循环搜索结束后饭后列表l.

实现代码如下:

class Solution:
    def findSubstring(self, s: str, words: List[str]) -> List[int]:
        words = sorted(words)
        l = []
        if len(words)==0:
            return l
        e = len(words[0])
        w = len(words)
        t = e * w
        if len(s)<t:
            return l
        for word in set(words):
            for i in range(len(s)-t+1):
                res = list()
                if s[i:i+e] == word:
                    for j in range(i,i+t,e):
                        res.append(s[j:j+e])
                    res = sorted(res)
                    if res == words:
                        l.append(i)
        return l
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值