Day31.算法训练

491. 递增子序列

class Solution {

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

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

    public List<List<Integer>> findSubsequences(int[] nums) {
        int[] useds = new int[nums.length];
        findSubsequences(nums, 0, useds);
        return result;
    }

    public void findSubsequences(int[] nums, int startIndex, int[] useds) {

        if (path.size() > 1) {
            result.add(new ArrayList<>(path));
        }

        Set<Integer> set = new HashSet<>();
        for (int i = startIndex; i < nums.length; i++) {

            if (!set.add(nums[i])) {
                continue;
            }
            if (!path.isEmpty() && nums[i] < path.get(path.size() - 1)) {
                continue;
            }

            path.add(nums[i]);

            useds[i] = 1;

            findSubsequences(nums, i + 1, useds);

            useds[i] = 0;
            path.remove(path.size() - 1);
        }
    }
}

46. 全排列

class Solution {

    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();

    public List<List<Integer>> permute(int[] nums) {
        int[] useds = new int[nums.length];
        permute(nums, useds);
        return result;
    }

    public void permute(int[] nums, int[] useds) {
        if (path.size() == nums.length) {
            result.add(new ArrayList<>(path));
            return;
        }

        for (int i = 0; i < nums.length; i++) {
            
            if (useds[i] == 1) {
                continue;
            }
            
            path.add(nums[i]);
            useds[i] = 1;

            permute(nums, useds);

            useds[i] = 0;
            path.remove(path.size() - 1);
        }

    }
}

47. 全排列 II

class Solution {

    List<List<Integer>> result = new ArrayList<>();
    List<Integer> path = new ArrayList<>();

    public List<List<Integer>> permuteUnique(int[] nums) {
        Arrays.sort(nums);
        int[] useds = new int[nums.length];
        permuteUnique(nums, useds);
        return result;
    }

    public void permuteUnique(int[] nums, int[] useds) {

        if (path.size() == nums.length) {
            result.add(new ArrayList<>(path));
        }

        for (int i = 0; i < nums.length; i++) {
            if (useds[i] == 1) {
                continue;
            }

            if (i > 0 && nums[i] == nums[i - 1] && useds[i - 1] == 0) {
                continue;
            }

            path.add(nums[i]);
            useds[i] = 1;

            permuteUnique(nums, useds);

            useds[i] = 0;
            path.remove(path.size() - 1);
        }
    }
}