Word Break

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".

之前整理过动规的写法，今天加上自己写的dfs写法。

因为中间有许多重复的判断情况，需要用到memorize，于是加了一个hashmap

代码：

//    public boolean wordBreak(String s, Set<String> wordDict) {
//        if(s == null || wordDict == null) return false;
//        if(s.length() == 0 && wordDict.size() == 0) return true;
//
//        //int []dp array to indicate that whether it is possible to that the letters before index i are concated from the dictionary
//        boolean[] dp = new boolean[s.length()+1];
//        dp[0] = true;
//
//        for(int i=1;i<=s.length();i++){
//            for(int j=0;j<i;j++){
//                if(dp[j] && wordDict.contains(s.substring(j, i))){
//                    dp[i]=true;
//                    break;
//                }
//            }
//        }
//        return dp[s.length()];
//    }

    public boolean wordBreak(String s, Set<String> wordDict) {
        if(s == null || wordDict == null) return false;
        if(s.length() == 0 && wordDict.size() == 0) return true;
        return dfs(s, wordDict, 0);
    }

    HashMap<String, Boolean> cache = new HashMap<>();
    private boolean dfs(String s, Set<String> wordDict, int index){
        if(index == s.length()) return true;
        boolean find = false;
        for(int i=index+1;i<=s.length();i++){
            String sub = s.substring(index, i);
            if(cache.containsKey(sub)){
                if(cache.get(sub)){
                    find = true;
                    break;
                }else{
                    continue;
                }
            }
            if(wordDict.contains(sub)){
                if(dfs(s, wordDict, i)){
                    find = true;
                    cache.put(sub, true);
                    break;
                }else{
                    cache.put(sub, false);
                }
            }
        }

        return find;
    }