-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path139. Word Break
More file actions
133 lines (74 loc) · 2.18 KB
/
139. Word Break
File metadata and controls
133 lines (74 loc) · 2.18 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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
class Solution {
static boolean solve(int ind , String s, List<String> wordDict , Boolean dp[])
{
if(ind >= s.length()) return true;
if(dp[ind] != null) return dp[ind];
boolean res = false;
for(String st : wordDict)
{
int n = st.length();
if(s.length() - ind < n) continue;
if(s.substring(ind , ind + n).equals(st) && solve(ind + n , s , wordDict , dp))
{
res = true;
break;
}
}
return dp[ind] = res;
}
public boolean wordBreak(String s, List<String> wordDict)
{
return solve(0 , s , wordDict , new Boolean[s.length()]);
}
}
--------------------------------------------------------------------------------------------------------------------------
class Solution {
public boolean wordBreak(String s, List<String> wordDict)
{
// return dict(s, wordDict, 0);
Boolean [] dp = new Boolean[s.length()];
return sol(0, s, wordDict, dp);
}
public boolean sol(int index, String s, List<String> word, Boolean[] dp)
{
int n = s.length();
if(index == n)
{
return true;
}
if(dp[index] != null)
{
return dp[index];
}
for(int i = index+1; i<=n;i++)
{
if(word.contains(s.substring(index, i)) && sol(i, s, word, dp))
{
return dp[index] = true;
}
}
return dp[index] = false;
}
/*
public boolean dict(String A, List<String> B, int word)
{
if(word == A.length())
{
return true;
}
String str = "";
for(int i = word; i< A.length(); i++)
{
str += A.charAt(i);
if(B.contains(str))
{
if(dict(A, B, i+1) == true)
{
return true;
}
}
}
return false;
}
*/
}