采用暴力法(brute force 简称BF,普通模式匹配)
思路:1,首先判断字符串的第一个字符在不在字典里,如果在,判断第二个字符在不在字典里,如果不在,前两个字符在不在字典里,依次迭代;
2,这里用到了递归,如果满足条件则往后遍历下去,存中间结果,直到遍历到了字符串的末尾 ,这时候就出现一个可以分解的组合,存入rsList
代码如下:
public class Solution {
public List<string> wordBreak(String s, Set<string> dict) {
List<string> rsList = new ArrayList<string>();
if (s == null || s.length() < 1 || dict == null) {
return rsList;
}
wordBreakHelper(s, 0, "", dict, rsList);
return rsList;
}
public void wordBreakHelper(String s, int start, String tempStr, Set<string> dict, List<string> rsList) {
if (start >= s.length()) {
rsList.add(tempStr);
return;
}
for (int i = start + 1; i <= s.length(); i++) {
String temp = s.substring(start, i);
if (dict.contains(temp)) {
String newTempStr;
newTempStr=tempStr.length()<1?temp:(tempStr+" "+temp)
wordBreakHelper(s, i, newTempStr, dict, rsList);
}
}
}