class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int n = s.size();
vector<bool> f(n+1, false);
f[0] = true;
for(int i = 1; i <= n; ++i)
{
for(int k = 0; k < i; ++k)
{
f[i] = f[k] && (dict.find(s.substr(k, i-k)) != dict.end());
if(f[i]) break;
}
}
return f[n];
}
};
[LeetCode]Word Break
最新推荐文章于 2023-06-01 11:39:37 发布