PermutationsII

  • 2022-12-14
  • 浏览 (517)

PermutationsII.java 源码

package algorithm.backtracking.leetcode;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 * @author roseduan
 * 全排列II
 */
public class PermutationsII {

    public List<List<Integer>> permuteUnique(int[] nums) {
        Set<List<Integer>> res = new HashSet<>();
        dfs(nums, new ArrayList<>(), res);
        return new ArrayList<>(res);
    }

    private void dfs(int[] nums, List<Integer> list, Set<List<Integer>> res) {
        if (list.size() == nums.length) {
            List<Integer> temp = new ArrayList<>();
            for (int i : list) {
                temp.add(nums[i]);
            }
            res.add(temp);
            return;
        }

        for (int i = 0; i < nums.length; i++) {
            if (!list.contains(i)) {
                list.add(i);
                dfs(nums, list, res);
                list.remove(list.size() - 1);
            }
        }
    }
}

你可能感兴趣的文章

Bag

EightQueues

GenerateParentheses

0  赞