Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitc0bc3df

Browse files
word break II
1 parenta2eb99b commitc0bc3df

File tree

2 files changed

+58
-0
lines changed

2 files changed

+58
-0
lines changed

‎HARD/src/hard/WordBreakII.java

Lines changed: 57 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,57 @@
1+
packagehard;
2+
importjava.util.*;
3+
/**
4+
* Created by fishercoder1534 on 10/4/16.
5+
*/
6+
publicclassWordBreakII {
7+
publicList<String>wordBreak(Strings,Set<String>wordDict) {
8+
returndfs(s,wordDict,newHashMap<String,ArrayList<String>>());
9+
}
10+
11+
privateList<String>dfs(Strings,Set<String>wordDict,
12+
HashMap<String,ArrayList<String>>map) {
13+
if(map.containsKey(s)){
14+
returnmap.get(s);
15+
}
16+
17+
ArrayList<String>res =newArrayList<String>();
18+
if(s.length() ==0){
19+
res.add("");
20+
returnres;
21+
}
22+
23+
for(Stringword :wordDict){
24+
if(s.startsWith(word)){
25+
List<String>subList =dfs(s.substring(word.length()),wordDict,map);
26+
for(Stringsub :subList){
27+
res.add(word + (sub.length() ==0 ?"" :" ") +sub);
28+
}
29+
}
30+
}
31+
map.put(s,res);
32+
returnres;
33+
}
34+
35+
publicstaticvoidmain(String...strings){
36+
List<String>temp =newArrayList<String>();
37+
System.out.println(temp);
38+
List<String>temp2 =newArrayList<String>(temp);
39+
temp2.add("");
40+
System.out.println(temp2);
41+
42+
WordBreakIItest =newWordBreakII();
43+
Set<String>wordDict =newHashSet<>();
44+
wordDict.add("cat");
45+
wordDict.add("cats");
46+
wordDict.add("sand");
47+
wordDict.add("and");
48+
wordDict.add("dog");
49+
Strings ="catsanddog";
50+
// List<String> list = test.wordBreak(s, wordDict);
51+
List<String>list =test.wordBreak(s,wordDict);
52+
for(Stringword :list){
53+
System.out.print(word +", ");
54+
}
55+
System.out.println();
56+
}
57+
}

‎README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22
| # | Title | Solutions | Time | Space | Difficulty | Tag | Notes
33
|-----|----------------|------------------|-------|--------|------------|-----|------
44
|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)|[Solution](../../blob/master/EASY/src/easy/FirstBadVersion.java)| O(logn)|O(1) | Easy| Binary Search
5+
|140|[Word Break II](https://leetcode.com/problems/word-break-ii/)|[Solution](../../blob/master/HARD/src/hard/WordBreakII.java)| |O(n^2) | Hard| Backtracking/DFS
56
|139|[Word Break](https://leetcode.com/problems/word-break/)|[Solution](../../blob/master/MEDIUM/src/medium/WordBreak.java)| O(n^2)|O(n) | Medium| DP
67
|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)|[Solution](../../blob/master/MEDIUM/src/medium/CloneGraph.java)| O(n)|O(n) | Medium| HashMap, BFS
78
|91|[Decode Ways](https://leetcode.com/problems/decode-ways/)|[Solution](../../blob/master/MEDIUM/src/medium/DecodeWays.java)| O(n)|O(n) | Medium| DP

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp