update 46

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_46.java

@@ -11,10 +11,10 @@ public static class Solution1 {
         public List<List<Integer>> permute(int[] nums) {
             List<List<Integer>> result = new ArrayList();
             result.add(new ArrayList<>());
-            return backtracking(nums, 0, result);
+            return recursion(nums, 0, result);
         }
 
-        private List<List<Integer>> backtracking(int[] nums, int index, List<List<Integer>> result) {
+        private List<List<Integer>> recursion(int[] nums, int index, List<List<Integer>> result) {
             if (index == nums.length) {
                 return result;
             }
@@ -27,7 +27,7 @@ private List<List<Integer>> backtracking(int[] nums, int index, List<List<Intege
                 }
             }
             result = newResult;
-            return backtracking(nums, index + 1, result);
+            return recursion(nums, index + 1, result);
         }
     }