-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathWordBreak.java
More file actions
73 lines (67 loc) · 1.63 KB
/
Copy pathWordBreak.java
File metadata and controls
73 lines (67 loc) · 1.63 KB
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
/*public static int numberOfSteps(int[] a) {
if( a.length==0 ) return 0;
int min= a[0];
int total = a[0];
for(int i=1;i<a.length;i++) {
if( a[i] < min ) min = a[i];
total += a[i];
}
return total - a.length * min;
}*/
public class WordBreak {
Set<String> dic = new HashSet<>();
boolean wordBreak(String s) {
if (this.dic.contains(s)) return true;
boolean res = false;
int [][]table = new int[s.length()][s.length()+1];
table[0][0] = 1;
for (int i = 0 ;i< s.length() ;i++)
for (int k = i+1; k<=s.length() ; k++) {
if (this.dic.contains(s.substring(i, k))) {
//if (i == 0) {
//table[i][k] = 1;
//}
//else
if (table[0][i] == 1) {
table[i][k] = 1;
if (k == s.length()) res = true;
}
}
}
for (int i =0 ;i<s.length();i++){
for (int j= 0;j<=s.length();j++) {
System.out.print(table[i][j]);
}
System.out.println("\n");
}
return res;
/*int [] p = new int[s.length()+1];
Arrays.fill(p, -1);
p[0] = 0;
for (int i = 0 ;i < s.length() ;i++) {
if (p[i] != -1) {
for (int j = i+1; j<=s.length() ;j++) {
if (this.dic.contains(s.substring(i, j))) {
p[j] = i;
}
}
}
}
for (int i = 0;i<= s.length();i++) {
System.out.print(p[i] + " ");
}
return p[s.length()];*/
}
public static void main(String[] args) {
WordBreak obj = new WordBreak();
obj.dic.add("ball");
obj.dic.add("room");
obj.dic.add("all");
obj.dic.add("the");
String s = "ballroom";
System.out.println("Last place of substring " + obj.wordBreak(s));
}
}