#46 Permutations

Description

Given a collection of distinct integers, return all possible permutations.

Example:

Input: [1,2,3]
Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1] ]

解题思路

递归

class Solution {
    public void getList(List<Integer> now, List<List<Integer>> all, List<Integer> cur){
        if(cur.isEmpty()){
            all.add(new ArrayList<>(now));
            return;
        }
        for(int i = 0; i < cur.size(); i++){
            Integer temp = cur.get(i);
            cur.remove(i);
            now.add(temp);
            getList(now, all, cur);
            cur.add(i, temp);
            now.remove(temp);
        }
    }
    public List<List<Integer>> permute(int[] nums) {
        List<Integer> s = new ArrayList<>();
        for(int i = 0; i < nums.length; i++){
            s.add(nums[i]);
        }
        List<Integer> now = new ArrayList<>();
        List<List<Integer>> all = new ArrayList<>();
        getList(now, all, s);
        return all;
    }
}

记录下 List 的 remove 函数
remove(Object obj) / remove(int index)
那在调用 remove 的时候要判断是index还是obj，obj需要先Integer temp = cur.get(i)