zoukankan      html  css  js  c++  java
  • LeetCode 140. Word Break II

    原题链接在这里:https://leetcode.com/problems/word-break-ii/

    题目:

    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 sentences.

    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 = "catsanddog"
    wordDict = ["cat", "cats", "and", "sand", "dog"]
    Output:
    [
      "cats and dog",
      "cat sand dog"
    ]
    

    Example 2:

    Input:
    s = "pineapplepenapple"
    wordDict = ["apple", "pen", "applepen", "pine", "pineapple"]
    Output:
    [
      "pine apple pen apple",
      "pineapple pen apple",
      "pine applepen apple"
    ]
    Explanation: Note that you are allowed to reuse a dictionary word.
    

    Example 3:

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

    题解:

    When it needs all the possible results, it comes to dfs.

    Could use memo to prune branches. Use memo means divide and conquer, not iterative.

    If cache already has key s, then return list value.

    Otherwise, get either head or tail of s, check if it is in the wordDict. If yes, put the rest in the dfs and get intermediate result.

    Iterate intermediate result, append each candidate and add to res.

    Update cache and return res.

    Note: When wordDict contains current s, add it to res. But do NOT return. Since it may cut more possibilities. 

    e.g. "dog" and "dogs" are both in the result. If see "dogs" and return, it cut all the candidates from "dog".

    Time Complexity: exponential.

    Space: O(n). stack space O(n).

    AC  Java:

     1 class Solution {
     2     Map<String, List<String>> cache = new HashMap<>(); 
     3     public List<String> wordBreak(String s, List<String> wordDict) {
     4         List<String> res = new ArrayList<>();
     5         
     6         if(s == null || s.length() == 0){
     7             return res;
     8         }
     9         
    10         if(cache.containsKey(s)){
    11             return cache.get(s);
    12         }
    13         
    14         if(wordDict.contains(s)){
    15             res.add(s);
    16         }
    17         
    18         for(int i = 1; i<s.length(); i++){
    19             String tail = s.substring(i);
    20             if(wordDict.contains(tail)){
    21                 List<String> cans = wordBreak(s.substring(0, i), wordDict);
    22                 for(String can : cans){
    23                     res.add(can + " " + tail);
    24                 }
    25             }
    26         }
    27         
    28         cache.put(s, res);
    29         return res;
    30     }
    31 }

    类似Word Break.

  • 相关阅读:
    Nginx 负载均衡
    wordpress 页面显示指定分类文章
    Linux 下 wordpress 无法安装插件
    在 Linux 上安装配置 BitTorrent Sync [转]
    nagios 配置 check_traffic 流量监控模块(Server 端)
    install nagios pnp4nagios on centos 6
    bat 脚本处理windows 文件
    Mac 下重新安装配置ibm Lotus 邮箱
    Domino 邮箱服务器接收不存在的邮箱账号的邮件
    Linux 下统计Apache每分钟的并发数
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/4824963.html
Copyright © 2011-2022 走看看