change to list

tg123 · tg123 · commit ad11b797248a · 2014-08-31T00:45:47.000+08:00
diff --git a/permutations-ii/Solution.java b/permutations-ii/Solution.java
@@ -1,4 +1,5 @@
 public class Solution {
+    
     void swap(int x[], int a, int b) {
     	int t = x[a];
     	x[a] = x[b];
@@ -37,19 +38,18 @@ public boolean nextPermutation(int[] num) {
         return true;
     }    
     
-    ArrayList<Integer> asList(int[] num){
+    List<Integer> asList(int[] num){
         ArrayList<Integer> l = new ArrayList<Integer>(num.length);
         for(int i = 0; i < num.length; i++)
             l.add(num[i]);
         
         return l;
     }
     
-    public ArrayList<ArrayList<Integer>> permuteUnique(int[] num) {
-        // Note: The Solution object is instantiated only once and is reused by each test case.
+    public List<List<Integer>> permuteUnique(int[] num) {
         Arrays.sort(num);
         
-        ArrayList<ArrayList<Integer>> found = new ArrayList<ArrayList<Integer>>();
+        ArrayList<List<Integer>> found = new ArrayList<List<Integer>>();
         found.add(asList(num));
         
         while(nextPermutation(num)){
@@ -58,4 +58,4 @@ public ArrayList<ArrayList<Integer>> permuteUnique(int[] num) {
         
         return found;
     }
-}
+}
