fd

Author: liwentian

ebook/Backtracking.aux

@@ -28,9 +28,15 @@
 \@writefile{toc}{\contentsline {section}{\numberline {1.7}Word Search II}{8}{section.1.7}}
 \@writefile{toc}{\contentsline {subsubsection}{Description}{8}{section*.13}}
 \@writefile{toc}{\contentsline {subsubsection}{Solution}{8}{section*.14}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.8}Word Break}{10}{section.1.8}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{10}{section*.15}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{10}{section*.16}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.9}Word Break II}{11}{section.1.9}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{11}{section*.17}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{11}{section*.18}}
 \FN@pp@footnotehinttrue 
 \@setckpt{Backtracking}{
-\setcounter{page}{10}
+\setcounter{page}{12}
 \setcounter{equation}{0}
 \setcounter{enumi}{0}
 \setcounter{enumii}{0}
@@ -40,20 +46,20 @@
 \setcounter{mpfootnote}{0}
 \setcounter{part}{0}
 \setcounter{chapter}{1}
-\setcounter{section}{7}
+\setcounter{section}{9}
 \setcounter{subsection}{0}
 \setcounter{subsubsection}{0}
 \setcounter{paragraph}{0}
 \setcounter{subparagraph}{0}
 \setcounter{figure}{1}
 \setcounter{table}{0}
-\setcounter{FancyVerbLine}{41}
+\setcounter{FancyVerbLine}{25}
 \setcounter{pp@next@reset}{1}
 \setcounter{@fnserial}{0}
 \setcounter{Item}{0}
 \setcounter{Hfootnote}{0}
 \setcounter{Hy@AnnotLevel}{0}
-\setcounter{bookmark@seq@number}{8}
+\setcounter{bookmark@seq@number}{10}
 \setcounter{parentequation}{0}
 \setcounter{section@level}{3}
 }

ebook/Backtracking.tex

@@ -402,4 +402,85 @@ \subsubsection{Solution}
     dfs(set, board, i, j - 1, trie);
     board[i][j] ^= '#';
 }
-\end{Code}
+\end{Code}
+
+\newpage
+
+\section{Word Break}
+
+\subsubsection{Description}
+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. You may assume the dictionary does not contain duplicate words.
+
+For example, given
+s = \code{"leetcode"},
+dict = \code{["leet", "code"]}.
+
+Return true because \code{"leetcode"} can be segmented as \code{"leet code"}.
+
+\subsubsection{Solution}
+
+\begin{Code}
+public boolean wordBreak(String s, List<String> wordDict) {
+    int n = s.length();
+
+    boolean[] dp = new boolean[n + 1];
+    dp[0] = true;
+
+    for (int i = 1; i <= s.length(); i++) {
+        for (String word : wordDict) {
+            int j = i - word.length();
+            if (j >= 0 && dp[j] && s.substring(j, i).equals(word)) {
+                dp[i] = true;
+                break;
+            }
+        }
+    }
+
+    return dp[n];
+}
+\end{Code}
+
+\newpage
+
+\section{Word Break II}
+
+\subsubsection{Description}
+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. You may assume the dictionary does not contain duplicate words.
+
+Return all such possible sentences.
+
+For example, given
+s = \code{"catsanddog"},
+dict = \code{["cat", "cats", "and", "sand", "dog"]}.
+
+A solution is \code{["cats and dog", "cat sand dog"]}.
+
+\subsubsection{Solution}
+
+\begin{Code}
+public List<String> wordBreak(String s, List<String> wordDict) {
+    HashMap<String, List<String>> cache = new HashMap<>();
+    cache.put("", Arrays.asList(""));
+    return dfs(s, new HashSet<String>(wordDict), cache);
+}
+
+private List<String> dfs(String s, HashSet<String> wordDict, HashMap<String, List<String>> cache) {
+    if (cache.containsKey(s)) {
+        return cache.get(s);
+    }
+    List<String> result = new LinkedList<>();
+    for (int i = 0; i < s.length(); i++) {
+        String t = s.substring(i);
+        if (wordDict.contains(t)) {
+            List<String> list = dfs(s.substring(0, i), wordDict, cache);
+            if (list != null) {
+                for (String ss : list) {
+                    result.add((ss.length() > 0 ? ss + " " : "") + t);
+                }
+            }
+        }
+    }
+    cache.put(s, result);
+    return result;
+}
+\end{Code}

ebook/leetcode.log

@@ -1,4 +1,4 @@
-This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4)  5 SEP 2017 16:03
+This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4)  5 SEP 2017 16:09
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
@@ -1906,7 +1906,7 @@ File: images/phone.png Graphic file (type QTm)
 . with NFSS spec.: <->"Latin Modern Mono/BI/OT:script=latn;language=DFLT;"
 . - 'bold italic small caps'  (bx/itsc) with NFSS spec.: 
 .................................................
- [3] [4] [5] [6] [7] [8]) [9]
+ [3] [4] [5] [6] [7] [8] [9] [10]) [11]
 No file leetcode.ind.
 Package atveryend Info: Empty hook `BeforeClearDocument' on input line 42.
 Package atveryend Info: Empty hook `AfterLastShipout' on input line 42.
@@ -1918,10 +1918,10 @@ Package atveryend Info: Empty hook `AtVeryVeryEnd' on input line 42.
 Here is how much of TeX's memory you used:
  29160 strings out of 493591
  551638 string characters out of 6143547
- 568723 words of memory out of 5000000
+ 569017 words of memory out of 5000000
  32193 multiletter control sequences out of 15000+600000
  5076 words of font info for 53 fonts, out of 8000000 for 9000
  1347 hyphenation exceptions out of 8191
  65i,11n,77p,10414b,588s stack positions out of 5000i,500n,10000p,200000b,80000s
 
-Output written on leetcode.pdf (9 pages).
+Output written on leetcode.pdf (11 pages).

ebook/leetcode.out

@@ -6,3 +6,5 @@
 \BOOKMARK [1][-]{section.1.5}{\376\377\0001\000.\0005\000\040\000P\000e\000r\000m\000u\000t\000a\000t\000i\000o\000n\000s}{chapter.1}% 6
 \BOOKMARK [1][-]{section.1.6}{\376\377\0001\000.\0006\000\040\000W\000o\000r\000d\000\040\000S\000e\000a\000r\000c\000h}{chapter.1}% 7
 \BOOKMARK [1][-]{section.1.7}{\376\377\0001\000.\0007\000\040\000W\000o\000r\000d\000\040\000S\000e\000a\000r\000c\000h\000\040\000I\000I}{chapter.1}% 8
+\BOOKMARK [1][-]{section.1.8}{\376\377\0001\000.\0008\000\040\000W\000o\000r\000d\000\040\000B\000r\000e\000a\000k}{chapter.1}% 9
+\BOOKMARK [1][-]{section.1.9}{\376\377\0001\000.\0009\000\040\000W\000o\000r\000d\000\040\000B\000r\000e\000a\000k\000\040\000I\000I}{chapter.1}% 10