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

参考：http://blog.csdn.net/doc_sgl/article/details/12323015

class Solution {
public:
    bool wordBreakHelper(string s, unordered_set<string> &dict, set<string> &unmatched, int min, int max) {
        if(s == "") return true;
        // For the prefix of string s: from (0, min) to (0, max), check if it existed in the dict.
        for(int ii = max < s.length() ? max : s.length(); ii >= min; ii --) {
            string prefixstr = s.substr(0, ii);
            if(dict.find(prefixstr) != dict.end()) {
                string suffixstr = s.substr(ii);
                if(unmatched.find(suffixstr) != unmatched.end()) // The word in dict should only be used once.
                    continue;
                else {
                    if(wordBreakHelper(suffixstr, dict, unmatched, min, max))
                        return true;
                    else
                        unmatched.insert(suffixstr);
                }
            }
        }
        return false;
    }
    bool wordBreak(string s, unordered_set<string> &dict) {
        if(s == "") return true;
        if(dict.empty()) return false;
        auto it = dict.begin();
        // Find the max and min length of the words in dict.
        int max = (*it).length();
        int min = (*it).length();
        for(it ++; it != dict.end(); it ++) {
            if((*it).length() > max)
                max = (*it).length();
            if((*it).length() < min)
                min = (*it).length();
        }
        set<string> unmatched;
        return wordBreakHelper(s, dict, unmatched, min, max);
    }
};