leetcode Word Break II

最新推荐文章于 2020-05-25 01:46:09 发布
最新推荐文章于 2020-05-25 01:46:09 发布
阅读量932 收藏
点赞数
分类专栏： knowledge c++ 算法 leetcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/taoqick/article/details/38357329
版权
算法 同时被 3 个专栏收录
474 篇文章 6 订阅
订阅专栏
c++
265 篇文章 1 订阅
订阅专栏
leetcode
231 篇文章 0 订阅
订阅专栏

Give two versions of WA code:

Version 1: Runtime Error: Find the bug

class Solution {
 public:
  void find(const string& s, const unordered_set<string>& dict, vector<int>& res) {
    int i, j, len = s.length();
    for (i = 0; i < len; ++i) {
      if (dict.find(s.substr(0, i + 1)) != dict.end()) {
        res.push_back(i);
      }
    }
  }
  void addSpace(vector<string>& cur, vector<vector<string> >& resvec, 
                const string& s, const unordered_set<string>& dict) {
    if (s.length() == 0) {
      resvec.push_back(cur);
      return;
    }
    vector<int> breakpoints;
    find(s, dict, breakpoints);
    for (int i = 0; i < breakpoints.size(); ++i) {
      cur.push_back(s.substr(0, breakpoints[i] + 1));
      addSpace(cur, resvec, s.substr(breakpoints[i]), dict);
      cur.pop_back();
    }
  }
  vector<string> wordBreak(string s, unordered_set<string> &dict) {
    int i, j, size;
    vector<vector<string> > resvec;
    vector<string> res, cur;
    
    addSpace(cur, resvec, s, dict);
    for (i = 0; i < resvec.size(); ++i) {
      string tmp = resvec[i][0];
      for (j = 1; j < resvec[i].size(); ++j) 
        tmp += " " + resvec[i][j];
      res.push_back(tmp);
    }
    return res;
  }
};

Version 2: TLE 

class Solution {
 public:
  void find(const string& s, const unordered_set<string>& dict, vector<int>& res) {
    int i, j, len = s.length();
    for (i = 0; i < len; ++i) {
      if (dict.find(s.substr(0, i + 1)) != dict.end()) {
        res.push_back(i);
      }
    }
  }
  void addSpace(vector<string>& cur, vector<vector<string> >& resvec, 
                const string& s, const unordered_set<string>& dict) {
    if (s.length() == 0) {
      resvec.push_back(cur);
      return;
    }
    vector<int> breakpoints;
    find(s, dict, breakpoints);
    for (int i = 0; i < breakpoints.size(); ++i) {
      cur.push_back(s.substr(0, breakpoints[i] + 1));
      addSpace(cur, resvec, s.substr(breakpoints[i] + 1), dict);
      cur.pop_back();
    }
  }
  vector<string> wordBreak(string s, unordered_set<string> &dict) {
    int i, j, size;
    vector<vector<string> > resvec;
    vector<string> res, cur;
    
    addSpace(cur, resvec, s, dict);
    for (i = 0; i < resvec.size(); ++i) {
      string tmp = resvec[i][0];
      for (j = 1; j < resvec[i].size(); ++j) 
        tmp += " " + resvec[i][j];
      res.push_back(tmp);
    }
    return res;
  }
};
Version 3: AC Code: 


class Solution {
 public:
  void find(const string& s, const unordered_set<string>& dict, vector<int>& res) {
    int i, j, len = s.length();
    for (i = 0; i < len; ++i) {
      if (dict.find(s.substr(0, i + 1)) != dict.end()) {
        res.push_back(i);
      }
    }
  }
  void addSpace(vector<string>& cur, vector<vector<string> >& resvec, 
                const string& s, const unordered_set<string>& dict, vector<int>& forbidden) {
    
    if (s.length() == 0) {
      resvec.push_back(cur);
      return;
    }
    if (forbidden[s.length()])
      return;
    vector<int> breakpoints;
    find(s, dict, breakpoints);
    for (int i = 0; i < breakpoints.size(); ++i) {
      cur.push_back(s.substr(0, breakpoints[i] + 1));
      int resvecsize = resvec.size();
      addSpace(cur, resvec, s.substr(breakpoints[i] + 1), dict, forbidden);
      if (resvec.size() == resvecsize)
        forbidden[s.length()-breakpoints[i]-1] = 1;
      cur.pop_back();
    }
  }
  vector<string> wordBreak(string s, unordered_set<string> &dict) {
    int i, j, size;
    vector<vector<string> > resvec;
    vector<string> res, cur;
    vector<int> forbidden(s.length()+1, 0);
    
    addSpace(cur, resvec, s, dict, forbidden);
    for (i = 0; i < resvec.size(); ++i) {
      string tmp = resvec[i][0];
      for (j = 1; j < resvec[i].size(); ++j) 
        tmp += " " + resvec[i][j];
      res.push_back(tmp);
    }
    return res;
  }
};




taoqick
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
leetcode题解：第139题Word Break
chenf1999的博客
08-07 380
https://leetcode-cn.com/problems/word-break/ 文章目录解法一、回溯代码解法二、动态规划代码复杂度分析 解法一、回溯 依照惯例，没有好的思路的时候，就先想想暴力解法怎么做。暴力解法无非是逐个单词地拆分字符串，每次选的单词可以重复。要实现暴力解法的话，肯定就是用回溯，因为回溯算法“撤销选择”的特点，保证了每次都能考虑到所有的单词。 简而言之，对于字符串s和单词word，word长度为n，当word与s[:n]相同时，就可以把word选来进行一次拆分，紧接着继续判断s[
Leetcode 140. Word Break II (python+cpp)
qq_37821701的博客
09-30 546
Leetcode 140. Word Break II题目解法1：动态规划+暴力递归解法2：recursion+memorization总结 题目 解法1：动态规划+暴力递归 首先用word break I的方法来判断是否能够拆分 能拆分之后，暴力recursion解出所有答案 class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> List[str]: def check(s):
Leetcode Word Break II
架构设计
03-04 128
Word Break II Given a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example...
leetcode word-break-ii(Java)
聚沙成塔
04-20 370
leetcode题目 word-break-ii 题目描述 * Given a string s and a dictionary of words dict, * add spaces in s to construct a sentence where each word is a valid dictionary word. * Return all such possible ...
LeetCode_Word Break II
loveRooney的专栏
07-06 797
在Word Break第一问的基础上，我们首先确定了在
[LeetCode]Word Break II
孙佰贵的专栏
11-20 1740
class Solution { //initialization problem will cause WA, because wordBreak whould be called several times for several cases in one instance //the whole memozation will also record the string which has
Leetcode 139. Word Break （python+cpp）
qq_37821701的博客
05-25 527
Leetcode 129 Word Break题目解法1：recursion (TLE)解法2：recursion + memorization解法3：动态规划 题目 解法1：recursion (TLE) 最直观的解法就是用recursion将string不断分成小的部分，但是这样的方法会超时，代码如下： class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> bool: # recurrsio
【LeetCode】解题126：Word Ladder II（BFS算法）
Fayedily的博客
04-18 565
LeetCode解题 126：Word Ladder II（BFS算法）Problem 126: Word Ladder II [Hard]解题思路Solution (Java)修改过程 Problem 126: Word Ladder II [Hard] Given two words (beginWord and endWord), and a dictionary’s word list, ...
LeetCode 139. Word Break（dfs）
da_kao_la的博客
07-13 234
题目来源：https://leetcode.com/problems/word-break/ 问题描述 139.Word Break Medium Given anon-emptystringsand a dictionarywordDictcontaining a list ofnon-emptywords, determine ifscan be segmente...
【Leetcode】Word Break II
业精于勤，荒于嬉
07-05 988
题目链接：https://leetcode.com/problems/word-break-ii/ Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such po
LeetCode Word Break II
Dylan_Java_NYC的博客
09-13 479
原题链接在这里：https://leetcode.com/problems/word-break-ii/ 本题是Word Break的进阶题，要返回所有wordbreak的结果。 本题参照了这篇帖子：http://www.cnblogs.com/springfor/p/3877056.html 首先更具isWordBreak判断是否能拆，若能拆看从头到尾走，找到了一个wordDict里包含的
[leetcode]140. Word Break II
xiaocong1990的博客
06-04 359
链接：https://leetcode.com/problems/word-break-ii/description/ Given anon-emptystringsand a dictionarywordDictcontaining a list ofnon-emptywords, add spaces insto construct a sentence wh...
LeetCode 140. Word Break II（单词切分）
James Pan
05-27 2889
原题网址：https://leetcode.com/problems/word-break-ii/ Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return al
leetcode Word Break II
zhidao_wenge的专栏
06-07 417
int length;     vector one_result;     vector result;     vector > is_word;          void backTrack(string &s, int last, int index, vector &one_result)     {         if(last == length)        
leetcode word-breakII
pynash123的博客
04-07 135
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s =“catsandd...
leetcode 140. Word Break II
蓝羽飞鸟的博客
06-19 230
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible ...
LeetCode 动态规划与链表解题策略
单词拆分（Word Break）和141.环形链表（Linked List Cycle）。这两个问题展示了不同的数据结构和算法策略。 首先，139.单词拆分是一道关于动态规划的问题。动态规划是一种将复杂问题分解成较小子问题来解决的方法...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值