问题描述:
<span style="font-size:18px;">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".</span>
思路:
1.递归+回溯:每次传给函数字符串str、字典dict、开始匹配的位置;从开始匹配的位置开始start,匹配字符串为start+i;i是一个递增的变量,如果遇到了匹配的字符串,递归此函数直到字符串末尾;如果没有匹配到返回递归上一层,继续增加变量i的数值继续查找;
优点:容易想到 缺点:leetcode上显示超时;
2.动态规划:设置一个boolean的数组result,长度为str.lenth()+1;从字符串的第i(0<i<s.length())个字符开始,遍历str.substring(i,i+j),看它时候在dict中(i+j<s.length());如果在则将result[i+j]设置为true;一直遍历完,最后查看result[s.length()]是否为true,如果是返回true,否则为false;他的最优子问题为result[i]&&dict.contains(s.substring(i,i+j));
public class WordBreak {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
WordBreak WB = new WordBreak();
String str="leetcode";
Set<String> set = new HashSet<String>();
set.add("leet");
set.add("code");
System.out.println(set.contains(str.substring(0,4)));
System.out.println(WB.wordBreak(str, set));
}
public boolean wordBreak(String s, Set<String> dict) {
boolean[] result = new boolean[s.length()+1];
initArray(result);
if(s==null||s.equals("")||(dict.isEmpty()==true))
return false;
else{
for(int i=0;i<s.length();i++){//从s的第i个字母开始
for(int j=1;j<=s.length()-i ;j++){
// System.out.print(" "+result[i]+" "+dict.contains(s.subSequence(j,i+j))+" ");
// System.out.println(s.substring(i, i+j)+" "+j+" "+(i+j));
if(result[i]&&dict.contains(s.substring(i,i+j))){
System.out.println("---");
result[i+j]=true;
if(result[s.length()]==true)
break;
}
}
}
if(result[s.length()]==true)
return true;
else
return false;
}
}
//init array
public void initArray(boolean[] result){
for(int i=0;i<result.length;i++)
result[i]=false;
result[0]=true;
}
}