LeetCode--46--medium--Permutations

package com.app.main.LeetCode;

import java.util.ArrayList;
import java.util.List;

/**
 * 46
 *
 * medium
 *
 * https://leetcode.com/problems/permutations/
 *
 *
 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]
 ]

 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/9/23
 * Time:下午7:26
 */
public class Permutations {
    public List<List<Integer>> permute(int[] nums) {
        List<List<Integer>> result = new ArrayList<>();
        backtrack(result, new ArrayList<>(), nums);
        return result;
    }


    private void backtrack(List<List<Integer>> list, List<Integer> integers, int[] nums) {
        if (integers.size() == nums.length) {
            list.add(new ArrayList<>(integers));
        } else {
            for (int i = 0; i < nums.length; i++) {
                if (integers.contains(nums[i])) {
                    continue;
                }
                integers.add(nums[i]);
                backtrack(list, integers, nums);
                // 回溯
                integers.remove(integers.size() - 1);
            }
        }
    }






















}