LeetCode——Word Break

Word Break

Given a string s and a dictionary of words dict, determine ifs 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".

思路：

我们采用dp算法，定义dp[i]为s从0到i的字串是否可以匹配，那么我们最终要求的是dp[s.length()]是否为true。

动态准则为：dp[i]=dp[j]&&{s.substring(j,i-j)为字典中的词}。

代码：

class Solution {
public:
	bool wordBreak(string s, set<string> &dict) {
		if (s == "") {
			return true;
		}
		vector<bool> dp(s.length() + 1, false);
		dp[0] = true;
		for (int i = 0; i < s.length(); i++) {
			if (dp[i] == false) {
				continue;
			}
			for (int j = 1; i + j <= s.length(); j++) {
				if (dict.find(s.substr(i, j)) != dict.end()) {
					dp[i + j] = true;
					if (i + j == s.length()) {
						return true;
					}
				}
			}
		}
		return dp[s.length()];
	}
};

注意：当i+j等于s.length()时，就可以结束了，返回true。