JavaArithmetic/src/LeetCode/LeetCode47.java at master · git-jhy/JavaArithmetic · GitHub

Repository navigation

History

package LeetCode;

import java.util.ArrayList;

import java.util.LinkedList;

import java.util.List;

public class LeetCode47 {

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

// 全排列

private ArrayList<List<Integer>> res;

private boolean[] used;

public List<List<Integer>> permute(int[] nums) {

res = new ArrayList<>();

if (nums == null || nums.length == 0)

return res;

used = new boolean[nums.length];

LinkedList<Integer> p = new LinkedList<>();

generatePermutation(nums, 0, p);

return res;

}

// p中保存了一个有index-1个元素的排列。

// 向这个排列的末尾添加第index个元素, 获得一个有index个元素的排列

private void generatePermutation(int[] nums, int index, LinkedList<Integer> p) {

if (index == nums.length) {

res.add((List<Integer>) p.clone());

return;

}

for (int i = 0; i < nums.length; i++)

if (!used[i]) {

used[i] = true;

p.addLast(nums[i]);

generatePermutation(nums, index + 1, p);

// 回溯完要清除状态

p.removeLast();

used[i] = false;

}

return;

}

private static void printList(List<Integer> list) {

for (Integer e : list)

System.out.print(e + " ");

System.out.println();

}

public static void main(String[] args) {

int[] nums = {1, 2, 3};

List<List<Integer>> res = (new LeetCode47()).permute(nums);

for (List<Integer> list : res)

printList(list);

}

JavaArithmetic/src/LeetCode/LeetCode47.java at master · git-jhy/JavaArithmetic · GitHub

Repository navigation

Expand file tree

Breadcrumbs

LeetCode47.java

Latest commit

History

Breadcrumbs

LeetCode47.java

File metadata and controls