refactor 46

fishercoder1534 · fishercoder1534 · commit 5a1441f07770 · 2017-09-16T08:14:22.000-07:00
diff --git a/README.md b/README.md
@@ -573,7 +573,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |49|[Group Anagrams](https://leetcode.com/problems/group-anagrams/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_49.java)|O(m*logn)|O(m*n)|Medium| HashMap
 |48|[Rotate Image](https://leetcode.com/problems/rotate-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_48.java)|O(n^2)|O(1)| Medium | Array
 |47|[Permutations II](https://leetcode.com/problems/permutations-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_47.java)|O(n*n!)|O(n)|Medium|Backtracking
-|46|[Permutations](https://leetcode.com/problems/permutations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_46.java)|O(n*n!)|O(n)|Medium|Backtracking
+|46|[Permutations](https://leetcode.com/problems/permutations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_46.java)| O(n*n!) | O(n) | Medium | Backtracking
 |45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_45.java)|O(?)|O(?)|Hard|
 |44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_44.java)|O(m*n)|O(m*n)|Hard| Backtracking, DP, Greedy, String
 |43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_43.java)|O(n)|O(1)|Medium| Array, String
diff --git a/src/main/java/com/fishercoder/solutions/_46.java b/src/main/java/com/fishercoder/solutions/_46.java
@@ -3,7 +3,10 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**Given a collection of distinct numbers, return all possible permutations.
+/**
+ * 46. Permutations
+ *
+ * Given a collection of distinct numbers, return all possible permutations.
 
  For example,
  [1,2,3] have the following permutations:
@@ -14,18 +17,21 @@
  [2,3,1],
  [3,1,2],
  [3,2,1]
- ]*/
+ ]
+
+ */
+
 public class _46 {
-    static class AcceptedSolution {
+
+    public static class Solution1 {
         //this solution has a backtracking function that has a return type
-        public static List<List<Integer>> permute(int[] nums) {
+        public List<List<Integer>> permute(int[] nums) {
             List<List<Integer>> result = new ArrayList();
-            List<Integer> init = new ArrayList<>();
-            result.add(init);
+            result.add(new ArrayList<>());
             return backtracking(result, nums, 0);
         }
 
-        private static List<List<Integer>> backtracking(List<List<Integer>> result, int[] nums, int pos) {
+        private List<List<Integer>> backtracking(List<List<Integer>> result, int[] nums, int pos) {
             if (pos == nums.length) {
                 return result;
             }
@@ -42,16 +48,15 @@ private static List<List<Integer>> backtracking(List<List<Integer>> result, int[
         }
     }
 
-    static class AcceptedSolutionWithVoidType {
-        public static List<List<Integer>> permute(int[] nums) {
+    public static class Solution2 {
+        public List<List<Integer>> permute(int[] nums) {
             List<List<Integer>> result = new ArrayList();
-            List<Integer> init = new ArrayList<>();
-            result.add(init);
+            result.add(new ArrayList<>());
             recursive(result, nums, 0);
             return result;
         }
 
-        private static void recursive(List<List<Integer>> result, int[] nums, int pos) {
+        private void recursive(List<List<Integer>> result, int[] nums, int pos) {
             if (pos == nums.length) {
                 return;
             }
@@ -72,9 +77,4 @@ private static void recursive(List<List<Integer>> result, int[] nums, int pos) {
         }
     }
 
-    public static void main(String... args) {
-        int[] nums = new int[]{1, 2, 2};
-
-    }
-
 }
