Algorithms—140.Word Break II

思路：动态规划，很简单，就是写的比较糟糕，而且好多逻辑错误判定是time limit。。也是蛋疼。注意用一个新map存储走不通的路径。

public class Solution {
	Map<String,List<String>> map=new HashMap<String, List<String>>();
	Map<String,Boolean> bmap=new HashMap<String, Boolean>();
    public List<String> wordBreak(String s, Set<String> wordDict) {
    	List<String> list=new ArrayList<String>();
    	if(s==null||s.length()==0){
    		return list;
    	}
    	if (map.get(s)!=null) {
			return map.get(s);
		}
    	if(bmap.get(s)!=null){
    		return null;
    	}
    	for (int i = 0; i < s.length()-1; i++) {
			String k=s.substring(0,i+1);
			if(wordDict.contains(k)){
				String t=s.substring(i+1,s.length());
				if(bmap.get(t)==null){
					List<String> l=map.get(t);
					if (l!=null) {
						for (int j = 0; j < l.size(); j++) {
							list.add(k+" "+l.get(j));
						}
					}else {
						List<String> a=wordBreak(t,wordDict);
						if (a!=null) {
							for (int j = 0; j < a.size(); j++) {
								list.add(k+" "+a.get(j));
							}
						}
					}
				}
			}
		}
    	if(wordDict.contains(s)){
    		list.add(s);
    	}
    	if (list.size()==0) {
    		bmap.put(s, false);
			return list;
		}
    	map.put(s, list);
    	return list;
    }
}