fd

Author: liwentian

ebook/Backtracking.aux

@@ -15,28 +15,33 @@
 \@writefile{toc}{\contentsline {subsubsection}{Description}{3}{section*.5}}
 \@writefile{lof}{\contentsline {figure}{\numberline {图\nobreakspace 1-1}{ \ignorespaces Phone Keyboard}}{3}{section*.5}}
 \newlabel{fig:phone-keyboard}{{1-1}{3}{Description}{section*.5}{}}
-\@writefile{toc}{\contentsline {subsubsection}{Solution}{3}{section*.6}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution I}{3}{section*.6}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution II}{4}{section*.7}}
 \@writefile{toc}{\contentsline {section}{\numberline {1.4}Generate Parentheses}{5}{section.1.4}}
-\@writefile{toc}{\contentsline {subsubsection}{Description}{5}{section*.7}}
-\@writefile{toc}{\contentsline {subsubsection}{Solution}{5}{section*.8}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{5}{section*.8}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{5}{section*.9}}
 \@writefile{toc}{\contentsline {section}{\numberline {1.5}Permutations}{6}{section.1.5}}
-\@writefile{toc}{\contentsline {subsubsection}{Description}{6}{section*.9}}
-\@writefile{toc}{\contentsline {subsubsection}{Solution}{6}{section*.10}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{6}{section*.10}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{6}{section*.11}}
 \@writefile{toc}{\contentsline {section}{\numberline {1.6}Word Search}{7}{section.1.6}}
-\@writefile{toc}{\contentsline {subsubsection}{Description}{7}{section*.11}}
-\@writefile{toc}{\contentsline {subsubsection}{Solution}{7}{section*.12}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{7}{section*.12}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{7}{section*.13}}
 \@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 {subsubsection}{Description}{8}{section*.14}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{8}{section*.15}}
 \@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 {subsubsection}{Description}{10}{section*.16}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{10}{section*.17}}
 \@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}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{11}{section*.18}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution}{11}{section*.19}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.10}Combination Sum}{12}{section.1.10}}
+\@writefile{toc}{\contentsline {subsubsection}{Description}{12}{section*.20}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution I}{12}{section*.21}}
+\@writefile{toc}{\contentsline {subsubsection}{Solution II}{13}{section*.22}}
 \FN@pp@footnotehinttrue 
 \@setckpt{Backtracking}{
-\setcounter{page}{12}
+\setcounter{page}{14}
 \setcounter{equation}{0}
 \setcounter{enumi}{0}
 \setcounter{enumii}{0}
@@ -46,20 +51,20 @@
 \setcounter{mpfootnote}{0}
 \setcounter{part}{0}
 \setcounter{chapter}{1}
-\setcounter{section}{9}
+\setcounter{section}{10}
 \setcounter{subsection}{0}
 \setcounter{subsubsection}{0}
 \setcounter{paragraph}{0}
 \setcounter{subparagraph}{0}
 \setcounter{figure}{1}
 \setcounter{table}{0}
-\setcounter{FancyVerbLine}{25}
+\setcounter{FancyVerbLine}{21}
 \setcounter{pp@next@reset}{1}
 \setcounter{@fnserial}{0}
 \setcounter{Item}{0}
 \setcounter{Hfootnote}{0}
 \setcounter{Hy@AnnotLevel}{0}
-\setcounter{bookmark@seq@number}{10}
+\setcounter{bookmark@seq@number}{11}
 \setcounter{parentequation}{0}
 \setcounter{section@level}{3}
 }

ebook/Backtracking.tex

@@ -110,7 +110,7 @@ \subsubsection{Description}
 
 \textbf{Output:} \code{["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]}.
 
-\subsubsection{Solution}
+\subsubsection{Solution I}
 
 \begin{Code}
 private final String[] ARR = {
@@ -135,8 +135,13 @@ \subsubsection{Solution}
         helper(digits, start + 1, list, s + c);
     }
 }
+\end{Code}
 
-public List<String> letterCombinations2(String digits) {
+\subsubsection{Solution II}
+
+\begin{Code}
+
+public List<String> letterCombinations(String digits) {
     LinkedList<String> queue = new LinkedList<String>();
     if (digits.length() == 0) {
         return queue;
@@ -484,3 +489,83 @@ \subsubsection{Solution}
     return result;
 }
 \end{Code}
+
+\newpage
+
+\section{Combination Sum}
+\subsubsection{Description}
+Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
+
+The same repeated number may be chosen from C unlimited number of times.
+
+Note:
+
+All numbers (including target) will be positive integers.
+
+The solution set must not contain duplicate combinations.
+
+For example, given candidate set \code{[2, 3, 6, 7]} and target 7,
+
+A solution set is:
+\begin{code}
+[
+  [7],
+  [2, 2, 3]
+]
+\end{code}
+
+\subsubsection{Solution I}
+
+\begin{Code}
+public List<List<Integer>> combinationSum(int[] candidates, int target) {
+    List<List<Integer>> result = new LinkedList<>();
+    helper(candidates, result, new LinkedList<>(), target, 0);
+    return result;
+}
+
+private void helper(int[] candidates, List<List<Integer>> result, List<Integer> list, int target, int index) {
+    if (target < 0) {
+        return;
+    } else if (target == 0) {
+        result.add(new LinkedList<>(list));
+        return;
+    } else if (index >= candidates.length) {
+        return;
+    }
+
+    list.add(candidates[index]);
+    helper(candidates, result, list, target - candidates[index], index);
+    list.remove(list.size() - 1);
+
+    helper(candidates, result, list, target, index + 1);
+}
+
+\end{Code}
+
+\newpage
+
+\subsubsection{Solution II}
+
+\begin{Code}
+
+public List<List<Integer>> combinationSum(int[] candidates, int target) {
+    List<List<Integer>> result = new LinkedList<>();
+    dfs(candidates, target, 0, result, new LinkedList<Integer>());
+    return result;
+}
+
+private void dfs(int[] candidates, int target, int start, List<List<Integer>> result, List<Integer> list) {
+    if (target < 0) {
+        return;
+    }
+    if (target == 0) {
+        result.add(new LinkedList<>(list));
+        return;
+    }
+    for (int i = start; i < candidates.length; i++) {
+        list.add(candidates[i]);
+        dfs(candidates, target - candidates[i], i, result, list);
+        list.remove(list.size() - 1);
+    }
+}
+\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:09
+This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4)  5 SEP 2017 16:17
 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] [10]) [11]
+ [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]) [13]
 No file leetcode.ind.
 Package atveryend Info: Empty hook `BeforeClearDocument' on input line 42.
 Package atveryend Info: Empty hook `AfterLastShipout' on input line 42.
@@ -1916,12 +1916,12 @@ Package atveryend Info: Empty hook `AtEndAfterFileList' on input line 42.
 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
- 569017 words of memory out of 5000000
- 32193 multiletter control sequences out of 15000+600000
+ 29161 strings out of 493591
+ 551645 string characters out of 6143547
+ 569215 words of memory out of 5000000
+ 32194 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 (11 pages).
+Output written on leetcode.pdf (13 pages).

ebook/leetcode.out

@@ -8,3 +8,4 @@
 \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
+\BOOKMARK [1][-]{section.1.10}{\376\377\0001\000.\0001\0000\000\040\000C\000o\000m\000b\000i\000n\000a\000t\000i\000o\000n\000\040\000S\000u\000m}{chapter.1}% 11