Skip to content

udpate #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 16 commits into
base: master
Choose a base branch
from
Open

udpate #1

Changes from 1 commit
Commits
Show all changes
16 commits
Select commit Hold shift + click to select a range
ce9f06b
fix: 更新题目
Blankj May 17, 2018
2d53c02
update: 067
Blankj Oct 23, 2018
a5505e1
update: 001
SCBoyChina Oct 31, 2018
dc95795
add 030
Blankj Jan 31, 2019
a1f6cd5
Update README.md
Blankj Jan 31, 2019
b5c0f14
Merge pull request #22 from SCBoyChina/master
Blankj Apr 25, 2019
1a47041
update: 001
Blankj Apr 25, 2019
f05e6f9
Create FUNDING.yml
Blankj Jun 29, 2019
657138b
Update README.md
Blankj Aug 15, 2019
0d73c0e
Update README.md
Blankj Oct 12, 2019
867dc31
add 1014
Blankj Jun 18, 2020
dbe51e8
add 1028
Blankj Jun 29, 2020
845a0df
add 0209
Blankj Jul 6, 2020
81ed96d
add 0063
Blankj Jul 7, 2020
c781c49
add 16_11
Blankj Jul 8, 2020
0d17728
Update README.md
Blankj Dec 10, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update README.md 
upd 030
  • Loading branch information
@Blankj
Blankj authored Jan 31, 2019
commit a1f6cd5a3cc60bff95187b8aff33f8e4b6af24f9
4 changes: 2 additions & 2 deletions note/030/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,9 +29,9 @@ Output: []

## 思路

题意是给自个字符串 `s` 和等长度的单词数组 `words`，我们要找到的就是在 `s` 串中由所有单词组成的子串的索引（不要求顺序），不明白的话看下例子也就理解了，比如例子 1 的结果 [0, 9]：[`barfoo`,`foobar`] 就是符合的子串。
题意是给一个字符串 `s` 和等长度的单词数组 `words`，我们要找到的就是在 `s` 串中由所有单词组成的子串的索引（不要求顺序），不明白的话看下例子也就理解了，比如例子 1 的结果 [0, 9]：[`barfoo`,`foobar`] 就是符合的子串。

我们把 `words` 每个单词出现的次数都存入到一个 `map` 中，然后遍历 `s` 串，依次截取单词长度的子串做比较，如果都符合那就加入结果，如果不符合，我们要把和它相关联的不符合的都剔除掉，这样在之后遍历我们就可以跳过了达到优化的目的。
我们把 `words` 每个单词出现的次数都存入到一个 `map` 中，然后遍历 `s` 串，依次截取单词长度的子串做比较，如果都符合那就加入结果，如果不符合，我们要把和它相关联的不符合的都剔除掉，这样在之后的遍历就可以跳过该位置从而达到优化的目的。

```java
public class Solution {
Expand Down