1、word-break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
For example, given
s =”leetcode”,
dict =[“leet”, “code”].
Return true because”leetcode”can be segmented as”leet code”.
2、思路和代码如下:
package leetcode.dp;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
/**
* 思路:举个例子,有abcd,字典为{ab,ca,cde,f},abcd能否分解转换为 下列一个成立即可:
* (前0个可分解,abcd为字典的一个词)
* (前1个可分解,bcd为字典的一个词)
* (前2个可分解,cd为字典的一个词)
* (前3个可分解,d为字典的一个词)
*
* res[i] 表示前i个元素是否能被dict分解。默认res[0]=0;对应长度为len的s,res的长度为len+1;
* 动态转移方程为:res[i] =
* (res[0] && contains( substring(0,i) ) )||...||(res[j] && contains( substring(j,i) ) )...
* ||(res[i-1] && contains( substring(i-1,i) ) )
* 即为res[i] = i个( res[j] && contains( substring(j,i) ) ) 相或(0 <= j < i);
* @author Rail
*
*/
public class WordBreak {
public static void main(String[] args){
String s = "dogs";
Set<String> dict = new HashSet<String>();
boolean res = new WordBreak().wordBreak(s, dict);
System.out.println(res);
}
public boolean wordBreak(String s, Set<String> dict) {
int len = s.length();
boolean[] isWordBreak = new boolean[len + 1];
Arrays.fill( isWordBreak, false);
isWordBreak[0] = true;
int i, j;
for(i = 1; i <= len; i++){
for(j = 0; j < i; j++){
if(isWordBreak[j] && dict.contains(s.substring(j, i))){
isWordBreak[i] = true;
break;
}
}
}
return isWordBreak[len ];
}
}