Leetcode || Substring with Concatenation of All Words

最新推荐文章于 2019-12-26 08:25:23 发布

sjtu_chenchen

最新推荐文章于 2019-12-26 08:25:23 发布

阅读量411

点赞数

CC 4.0 BY-SA版权

分类专栏： java技术 leetcode 数据结构算法文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/sjtu_chenchen/article/details/49737035

java技术同时被 3 个专栏收录

96 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

数据结构算法

50 篇文章

订阅专栏

leetcode

32 篇文章

订阅专栏

给定字符串s和长度相同的单词列表words，找到s中所有由words中的单词依次连接而成的子串起始索引。例如，对于s='barfoothefoobarman'，words=['foo', 'bar']，返回[0, 9]。" 106064404,7683913,MongoDB核心概念与操作指南,"['数据库', 'NoSQL', 'MongoDB', '数据存储', '文档数据库']

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].

class Solution1 {
   
   
    /*
     * s: "barfoothefoobarman"
     * words: ["foo", "bar"]
     */
    public List<Integer> findSubstring(String s, String[] words) {