fd

Author: liwentian

README.md

@@ -205,6 +205,7 @@
 |251|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/Vector2D.java)|100|
 |252|[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MeetingRooms.java)|100|
 |253|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MeetingRoomsII.java)|90|
+|254|[Factor Combinations](https://leetcode.com/problems/factor-combinations/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/FactorCombinations.java)|80||
 |255|[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/VerifyPreorderSequenceInBinarySearchTree.java)|85|很简单，粗心错了|
 |256|[Paint House](https://leetcode.com/problems/paint-house/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/PaintHouse.java)|95|
 |257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/BinaryTreePaths.java)|80|

ebook/Backtracking.tex

@@ -2037,7 +2037,28 @@ \subsubsection{Descriptor}
 
 \subsubsection{Solution}
 \begin{Code}
+public List<List<Integer>> getFactors(int n) {
+    List<List<Integer>> result = new LinkedList<>();
+    dfs(n, 2, result, new LinkedList<>());
+    return result;
+}
+
+private void dfs(int n, int cur, List<List<Integer>> result, List<Integer> list) {
+    if (n <= 1) {
+        if (list.size() > 1) {
+            result.add(new LinkedList<>(list));
+        }
+        return;
+    }
 
+    for (int i = cur; i <= n; i++) {
+        if (n % i == 0) {
+            list.add(i);
+            dfs(n / i, i, result, list);
+            list.remove(list.size() - 1);
+        }
+    }
+}
 \end{Code}
 
 \newpage

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)  6 SEP 2017 09:52
+This is XeTeX, Version 3.14159265-2.6-0.99996 (TeX Live 2016) (preloaded format=xelatex 2017.9.4)  6 SEP 2017 10:26
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
@@ -1969,7 +1969,7 @@ File: images/watch.jpg Graphic file (type QTm)
 .
 \FV@Error ...ncyVerb Error:^^J\space \space #1^^J}
 
-l.2285 \end{Code}
+l.2306 \end{Code}
 
 This error message was generated by an \errmessage
 command, so I can't give any explicit help.
@@ -1982,7 +1982,7 @@ and deduce the truth by order and method.
 .
 \FV@Error ...ncyVerb Error:^^J\space \space #1^^J}
 
-l.2319 \end{Code}
+l.2340 \end{Code}
 
 (That was another \errmessage.)
 
@@ -1994,7 +1994,7 @@ File: images/unlock.png Graphic file (type QTm)
 .
 \FV@Error ...ncyVerb Error:^^J\space \space #1^^J}
 
-l.2419 \end{Code}
+l.2440 \end{Code}
 
 (That was another \errmessage.)
 

ebook/leetcode.pdf

@@ -0,0 +1,34 @@
+package com.inuker.solution;
+
+import java.util.LinkedList;
+import java.util.List;
+
+/**
+ * Created by liwentian on 2017/9/6.
+ */
+
+public class FactorCombinations {
+
+    public List<List<Integer>> getFactors(int n) {
+        List<List<Integer>> result = new LinkedList<>();
+        dfs(n, 2, result, new LinkedList<>());
+        return result;
+    }
+
+    private void dfs(int n, int cur, List<List<Integer>> result, List<Integer> list) {
+        if (n <= 1) {
+            if (list.size() > 1) {
+                result.add(new LinkedList<>(list));
+            }
+            return;
+        }
+
+        for (int i = cur; i <= n; i++) {
+            if (n % i == 0) {
+                list.add(i);
+                dfs(n / i, i, result, list);
+                list.remove(list.size() - 1);
+            }
+        }
+    }
+}

ebook/leetcode.synctex.gz

@@ -1,5 +1,6 @@
 package com.example;
 
+import com.inuker.solution.FactorCombinations;
 import com.inuker.solution.RestoreIPAddresses;
 import com.leetcode.google.DecodeString;
 import com.leetcode.google.GenerateParentheses;
@@ -27,6 +28,14 @@
 public class Main {
 
     public static void main(String[] args) {
+        List<List<Integer>> lists = new FactorCombinations().getFactors(128);
+//        List<List<Integer>> lists = new FactorCombinations().getFactors(23848713);
+        for (List<Integer> list : lists) {
+            for (Integer n : list) {
+                System.out.print(n + " ");
+            }
+            System.out.println();
+        }
     }
 }