[139] word-break (动态规划)
维护一个数组,存放从第字符串一个字符开始是否可以由字典中的单词组成,这样,如果想知道长为n的字符串是否可由字典中的单词组成,仅需要知道从这个字符之前任意一个判断为能的字符之后,组成的字符串在字典中即可。
import java.util.*;
public class Solution {
public boolean wordBreak(String s, Set<String> dict) {
int sign[] = new int[s.length() + 1];
sign[0] = 1;
for(int pos = 0;pos < s.length();pos++){
for(int i = pos; i >= 0;i--){
if(sign[i] == 1 && dict.contains(s.substring(i,pos+1))){
sign[pos+1] = 1;
}
}
}
return sign[s.length()] == 1;
}
}
[140] word-break ii (动态规划)
递归解法,不进行优化,结果超时
import java.util.*;
public class Solution {
public ArrayList<String> wordBreak(String s, Set<String> dict) {
ArrayList<String> strList = new ArrayList<String>();
formStr(strList,s,"",dict,-1);
return strList;
}
void formStr(ArrayList<String> strList,String s,String strNew,
Set<String> dict,int pos){
if(pos == s.length() - 1) {
strList.add(strNew);
return;
}
for (int i = pos + 1; i < s.length(); i++) {
if(dict.contains(s.substring(pos + 1,i + 1))){
String strTemp = strNew + " " + s.substring(pos + 1,i + 1);
formStr(strList,s,strTemp,dict,i);
}
}
}
}
进行优化,维护一个数组 flag,将不可能作为起始点的设置为1,下次再遇到这个点时就不继续往深层递归。
import java.util.*;
public class Solution {
public ArrayList<String> wordBreak(String s, Set<String> dict) {
ArrayList<String> strList = new ArrayList<String>();
int flag[] = new int[s.length() + 1];
flag[s.length()] = 0;
formStr(strList,flag,s,"",dict,-1);
return strList;
}
void formStr(ArrayList<String> strList,int flag[],String s,String strNew,
Set<String> dict,int pos){
if(pos == s.length() - 1) {
strList.add(strNew.substring(1,strNew.length()));
return;
}
//将从这个点开始的情况记录下来,如果从这个点开始不能产生任何新的字符串则将其置为1
int old = strList.size();
for (int i = pos + 1; i < s.length(); i++) {
if(flag[i + 1] == 0 && dict.contains(s.substring(pos + 1,i + 1))){
String strTemp = strNew + " " + s.substring(pos + 1,i + 1);
formStr(strList,flag,s,strTemp,dict,i);
}
}
if (strList.size() == old) flag[pos+1] = 1;
}
}