相关题目:
1、单词拆分二
class Solution {
public List<String> wordBreak(String s, List<String> wordDict) {
HashSet<String> wordSet = new HashSet<>(wordDict);
if(s==null||s.length()==0){
return new ArrayList<>();
}
boolean[] arr = new boolean[s.length() + 1];
arr[0] = true;
for (int i = 1; i <= s.length(); i++) {
for (int j = 0; j < i; j++) {
//第s.substring(i,j)为可拆分,其前提为,s.substring(0,i)可拆分.否则不可以。
if (arr[j] && wordSet.contains(s.substring(j, i))) {
arr[i] = true;
break;
}
}
}
List<String> l=new ArrayList<>();
LinkedList<String> item=new LinkedList();
if(arr[s.length()]){
back(s,l,item,wordSet, arr,s.length());
}
return l;
}
public void back(String s,List<String> l,LinkedList<String> item,HashSet<String> wordSet, boolean[] arr,int i){
if(i<=0){
l.add(String.join(" ",item));
return ;
}
for( int k=i-1;k>=0;k--){
if(arr[k]&& wordSet.contains(s.substring(k,i))){
item.addFirst(s.substring(k,i));
back(s,l,item,wordSet,arr, k);
item.pollFirst();
}
}
}
}