您的位置:首页 > 其它

leetcode 139 Word Break(阿里测试岗笔试题)

2015-10-18 19:57 387 查看
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"
.

class Solution {
public:
bool wordBreak(string s, unordered_set<string>& wordDict) {
vector<bool> qie(s.length()+1,false);
qie[0]=true;
for(int i=1;i<s.length()+1;++i){

for(int j=i-1;j>=0;--j)
{
if(qie[j]&&wordDict.find(s.substr(j,i-j))!=wordDict.end()){
qie[i]=true;
break;
}
}

}
return qie[s.length()];

}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: