由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - 关于Leetcode: Substring with Concatenation of All Words
相关主题
问大牛们一个Leetcode上的题Leetcode的Substring with Concatenation of All Words超时。
求DEBUG Substring with Concatenation of All WordsSubstring with Concatenation of All Words这题好麻烦
Substring with Concatenation of All WordsLeetCode LongestValidParentheses
帮忙看看为撒 leetcode OJ time out "Substring with Concatenation of All Words "leetcode online judge Longest Palindromic Substring memory limit exceeded
都来说说leetcode上无聊恶心的题吧 Memory Limit Exceeded: Longest Palindromic Substring
Leetcode第30题真心不容易Leetcode- Longest Substring Without Repeating Characters 的 test case
Substring with Concatenation of All Words 还有更简洁的解法吗?leetcode Longest Palindromic Substring Part II 有问题?
请问Substring with Concatenation of All Words?问问 leetcode 新题
相关话题的讨论汇总
话题: words话题: substring话题: leetcode话题: indices
进入JobHunting版参与讨论
1 (共1页)
g***l
发帖数: 352
1
题目:You are given a string, S, and a list of words, L, that are all of the
same length. Find all starting indices of substring(s) in S that is a
concatenation of each word in L exactly once and without any intervening
characters.
For example, given:
S: "barfoothefoobarman"
L: ["foo", "bar"]
You should return the indices: [0,9].
(order does not matter).
为什么[4,12]不满足要求?0,9之间也有别的characters呀?
l*****a
发帖数: 14598
2
start from 0: it is bar/foo
start from 9: it is foo/bar
which include all words of L
what is your result?

the

【在 g***l 的大作中提到】
: 题目:You are given a string, S, and a list of words, L, that are all of the
: same length. Find all starting indices of substring(s) in S that is a
: concatenation of each word in L exactly once and without any intervening
: characters.
: For example, given:
: S: "barfoothefoobarman"
: L: ["foo", "bar"]
: You should return the indices: [0,9].
: (order does not matter).
: 为什么[4,12]不满足要求?0,9之间也有别的characters呀?

t*****3
发帖数: 112
3
你得理解concatenation of each word中concatenation的含义

the

【在 g***l 的大作中提到】
: 题目:You are given a string, S, and a list of words, L, that are all of the
: same length. Find all starting indices of substring(s) in S that is a
: concatenation of each word in L exactly once and without any intervening
: characters.
: For example, given:
: S: "barfoothefoobarman"
: L: ["foo", "bar"]
: You should return the indices: [0,9].
: (order does not matter).
: 为什么[4,12]不满足要求?0,9之间也有别的characters呀?

g***l
发帖数: 352
4
Thanks. I misunderstood the question.

【在 t*****3 的大作中提到】
: 你得理解concatenation of each word中concatenation的含义
:
: the

1 (共1页)
进入JobHunting版参与讨论
相关主题
问问 leetcode 新题都来说说leetcode上无聊恶心的题吧
Longest Palindromic Substring from leetcodeLeetcode第30题真心不容易
请教:这个10来行的leetcode程序有什么问题?Substring with Concatenation of All Words 还有更简洁的解法吗?
Leetcode上Longest Valid Parentheses请问Substring with Concatenation of All Words?
问大牛们一个Leetcode上的题Leetcode的Substring with Concatenation of All Words超时。
求DEBUG Substring with Concatenation of All WordsSubstring with Concatenation of All Words这题好麻烦
Substring with Concatenation of All WordsLeetCode LongestValidParentheses
帮忙看看为撒 leetcode OJ time out "Substring with Concatenation of All Words "leetcode online judge Longest Palindromic Substring memory limit exceeded
相关话题的讨论汇总
话题: words话题: substring话题: leetcode话题: indices