LeetCode T46 Permutations

题目地址

https://leetcode-cn.com/problems/permutations/

题目描述

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Example 1:

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

Example 2:

Input: nums = [0,1]
Output: [[0,1],[1,0]]

Example 3:

Input: nums = [1]
Output: [[1]]

Constraints:

• 1 <= nums.length <= 6
• -10 <= nums[i] <= 10
• All the integers of nums are unique.

思路

数据量不大，递归回溯完全OK。

题解

class Solution {
    
    List<List<Integer>> lists = new ArrayList<List<Integer>>();
    List<Integer> list = new ArrayList<Integer>();

    public void permutation(int n,int[] nums,int cur){
        if(cur==n)
            lists.add(new ArrayList<Integer>(list));
        else for(int i=0;i< nums.length;++ i){
            int ok=1;
            for(int j=0;j<cur;j++)
                if(list.get(j)==nums[i]) ok=0;
                if(ok==1){
                    list.add(nums[i]);
                    permutation(n,nums,cur+1);
                    list.remove(list.size()-1);
                }
        }
    }
    public List<List<Integer>> permute(int[] nums) {
        permutation(nums.length,nums,0);
        return lists;
    }
}