LeetCode: Word Break

看的别人的代码改了下

class Solution {
public:
    bool wordBreak(string s, unordered_set<string> &dict) {
        vector<bool> f(s.size()+1);
        f[0] = true;
        for (int i = 1; i <= s.size(); i++) {
            for (int j = 0; j < i; j++) {
                f[i] = f[j] && (dict.count(s.substr(j, i-j)));
                if (f[i]) break;
            }
        }
        return f[s.size()];
    }
};

 C#

public class Solution {
    public bool WordBreak(string s, ISet<string> wordDict) {
        bool[] f = new bool[s.Length+1];
        f[0] = true;
        for (int i = 1; i <= s.Length; i++) {
            for (int j = 0; j < i; j++) {
                f[i] = f[j] && (wordDict.Contains(s.Substring(j, i-j)));
                if (f[i]) break;
            }
        }
        return f[s.Length];
    }
}