leetcode 139. 单词拆分

最新推荐文章于 2024-07-09 14:52:12 发布

技术的边界

最新推荐文章于 2024-07-09 14:52:12 发布

阅读量187

点赞数

文章标签： dp 单词拆分

本文链接：https://blog.csdn.net/L1558198727/article/details/101313739

版权

递归暴力超时

#include <iostream>
#include <vector>

using namespace std;

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        if( s.size()==0){
            return true;
        }else{
            for(int i=0;i<wordDict.size();i++){
                if( s.find( wordDict[i] ) == 0 ){

                    if( wordBreak( s.substr( wordDict[i].size() ),wordDict ) ){
                        return true;
                    }
                }
            }
            return false;
        }
        return false;
    }
};

int main()
{
    Solution Solution1;
    vector<string> disc = {"a","aa","aaa","aaaa","aaaaa","aaaaaa","aaaaaaa","aaaaaaaa","aaaaaaaaa","aaaaaaaaaa"};
    string s = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab";
    cout << Solution1.wordBreak(s,disc) << endl;
    return 0;
}

在这里插入图片描述

dp
dp[i]表示从s[0]开始长度为i的子串是不是可以拆分

#include <iostream>
#include <vector>

using namespace std;

#define debug(x) cout<<#x<<": "<<x<<endl;

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        vector<bool> dp(s.size()+1,0);
        dp[0] = 1;
        int i = 1;
        while( i <= s.size() ){

            if(dp[i-1]==1 ){
                for(int j=0;j < wordDict.size();j++){
                    if(  s.find( wordDict[j],i-1) == i-1){
                        dp[ i + wordDict[j].size()-1 ] = 1;
                    }
                }
            }
            i++;

        }

        return dp[ s.size() ];

    }
};

int main()
{
    Solution Solution1;
    vector<string> disc = {"a","aa","aaa","aaaa","aaaaa","aaaaaa","aaaaaaa","aaaaaaaa","aaaaaaaaa","aaaaaaaaaa"};
    string s = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab";
    cout << Solution1.wordBreak(s,disc) << endl;
    return 0;
}