-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathWordBreak.java
executable file
·41 lines (33 loc) · 1.3 KB
/
WordBreak.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
public class WordBreak {
public boolean wordBreak(String s, List<String> wordDict) {
return wordBreak(s, new HashSet<>(wordDict), 0, new int[301]);
}
//s.length is limited to 300
private boolean wordBreak(String s, Set<String> wordDict, int start, int[]array){
if (start == s.length()) {
return true;
}
if (array[start] != 0) {
return array[start] == 1;
}
for (int i = start + 1; i <= s.length(); i++) {
if (wordDict.contains(s.substring(start, i)) && wordBreak(s, wordDict, i, array)) {
array[start] = 1;
return true;
}
}
array[start] = -1;
return false;
}
public static void main(String[] args) {
String s = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab";
var wordList = Arrays.asList("a","aa","aaa","aaaa","aaaaa","aaaaaa","aaaaaaa","aaaaaaaa","aaaaaaaaa","aaaaaaaaaa");
WordBreak wordBreak = new WordBreak();
boolean b= wordBreak.wordBreak(s, wordList);
System.out.println(b);
}
}