leetcode - Word Break

最新推荐文章于 2022-02-13 19:30:15 发布

AkibaTakuya

最新推荐文章于 2022-02-13 19:30:15 发布

阅读量511

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/AkibaTakuya/article/details/39459587

版权

leetcode 专栏收录该内容

155 篇文章 0 订阅

订阅专栏

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(std::string s, std::unordered_set<std::string> &dict) {
        int n = (int)s.size();
		std::vector<int> dp(n+1,0);
		dp[0] = 1;
		for(int i = 1; i <= n; i++)
		{
			if(dp[i-1])
			{
				int index = i - 1;
				for(int j = index; j < n; j++)
				{
					std::string str = s.substr(index,j-index+1);
					if(dict.count(str) > 0)
						dp[j+1] = true;
				}
			}
		}
		return dp[n];
    }
};