LeetCode | 139. Word Break

 

题目：

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

Note:

• The same word in the dictionary may be reused multiple times in the segmentation.
• You may assume the dictionary does not contain duplicate words.

Example 1:

Input: s = "leetcode", wordDict = ["leet", "code"]
Output: true
Explanation: Return true because "leetcode" can be segmented as "leet code".

Example 2:

Input: s = "applepenapple", wordDict = ["apple", "pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
             Note that you are allowed to reuse a dictionary word.

Example 3:

Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"]
Output: false

 

代码：

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        set<string> wordSet;
		for (int i = 0; i < wordDict.size(); i++)
			wordSet.insert(wordDict[i]);
		vector<bool> dp(s.length() + 1, false);
		queue<int> index;
		dp[s.length()] = true;
		index.push(s.length() - 1);
		while (!index.empty())
		{
			int i = index.front();
			index.pop();
			for (int j = i; j >= 0; j--)
			{
				string cur_word = s.substr(j, i - j + 1);
				if (!dp[j] && wordSet.find(cur_word) != wordSet.end())
				{
					index.push(j-1);
					dp[j] = true;
				}
			}
		}
		return dp[0];
    }
};

 

题外话：

这道题貌似是开启了我漫漫牛客网刷题之路的开端，后来才转战leetcode~哈哈哈 万事开头难啊~