FilesExpand file tree

 master

/

PermutationsII.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

62 lines (58 loc) · 1.62 KB

 master

/

PermutationsII.java

Top

File metadata and controls

• Code
• Blame

62 lines (58 loc) · 1.62 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

package com.yangchd.leetcode.medium;

import java.util.ArrayList;

import java.util.HashSet;

import java.util.List;

import java.util.Set;

/**

* @author yangchd 2018/9/18.

*

* 47. Permutations II

* Given a collection of numbers that might contain duplicates, return all possible unique permutations.

*

* Example:

* Input: [1,1,2]

* Output:

* [

* [1,1,2],

* [1,2,1],

* [2,1,1]

* ]

*

*/

public class PermutationsII {

class Solution {

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

List<List<Integer>> list = new ArrayList<List<Integer>>();

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

return list;

}

backtrack(list, 0, nums);

return list;

}

private void backtrack(List<List<Integer>> list, int start, int[] nums) {

if (start == nums.length) {

List<Integer> temp = new ArrayList<Integer>();

for (int num : nums) {

temp.add(num);

}

if (!list.contains(temp)) {

list.add(temp);

}

return;

}

Set<Integer> set = new HashSet<Integer>();

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

if (set.add(nums[i])) {

swap(nums, start, i);

backtrack(list, start + 1, nums);

swap(nums, start, i);

}

}

}

private void swap(int[] nums, int i, int j) {

int temp = nums[i];

nums[i] = nums[j];

nums[j] = temp;

}

}

}