Word Break

最新推荐文章于 2024-06-09 18:36:47 发布

Nereus_Li

最新推荐文章于 2024-06-09 18:36:47 发布

阅读量605

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/li_chihang/article/details/43532823

版权

LeetCode 专栏收录该内容

113 篇文章 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".

解题思路：用动态规划来解.长度为i的字符串是否包含在字典是有长度j(j<i)的字符串是否包含以及i-j段字符串共同决定.

#include<iostream>
#include<vector>
#include<unordered_set>
using namespace std;

bool IsWord(string s, unordered_set<string> &dict)
{
	unordered_set<string>::iterator Iter = dict.find(s);
	if (Iter == dict.end())
		return false;
	else
		return true;
}
bool wordBreak(string s, unordered_set<string> &dict) {
	vector<bool>FalgWord(s.size()+1,false);
	FalgWord[0] = true;
	for (int i = 0; i <= s.size();++i)
	{
		for (int j = 0; j != i;++j)
		{
			if (FalgWord[i])
				break;
			else
				FalgWord[i] = FalgWord[j] && IsWord(s.substr(j, i - j), dict);
		}
	}
	return FalgWord[s.size()];
}

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".