您的位置:首页 > 其它

leetcode:Word Break

2014-11-18 21:54 120 查看
class Solution {
public:
bool wordBreak(string s, unordered_set<string> &dict) {
int n = s.length();
if(n == 0)
return true;
bool * canBreak = new bool
;
memset(canBreak,false, n*sizeof(bool));
for(int i = 0; i < n;i++)
{
if(dict.count(s.substr(0,i+1)) > 0)
{
canBreak[i] = true;
continue;
}
for(int j = 0; j < i;j++)
{
if(canBreak[j] && dict.count(s.substr(j+1,i-j))>0)
{
canBreak[i]=true;
break;
}
}
}
bool result = canBreak[n-1];
delete [] canBreak;
return result;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: