139 Word Break

1 题目

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

2 尝试解

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        string saver = s;
        for(int i = 0; i < s.size(); i++){ //check if substr(0,i) is breakable or not
            if(count(wordDict.begin(),wordDict.end(),s.substr(0,i+1)) != 0){ //if substr(0,i) in Dict, breakable
                saver[i] = '1';
                continue;
            }
            for(int j = 0; j < i; j++){//if substr(0,j) breakable,and substr(j+1,i) in Dict,breakable
                if(saver[j] =='1' && count(wordDict.begin(),wordDict.end(),s.substr(j+1,i-j))!=0){
                    saver[i] = '1';
                    break;
                }
            }
        }
        return saver.back() == '1';
    }
};

3 标准解

bool wordBreak(string s, unordered_set<string> &dict) {
        if(dict.size()==0) return false;
        
        vector<bool> dp(s.size()+1,false);
        dp[0]=true;
        
        for(int i=1;i<=s.size();i++)
        {
            for(int j=i-1;j>=0;j--)
            {
                if(dp[j])
                {
                    string word = s.substr(j,i-j);
                    if(dict.find(word)!= dict.end())
                    {
                        dp[i]=true;
                        break; //next i
                    }
                }
            }
        }
        
        return dp[s.size()];
    }