全排列（回溯法）

全排列（回溯法），LeetCode 46,47 ，剑指offer 27

1. 无重复的整数，全排列

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

public class LC46 {
    public List<List<Integer>> permuteUnique(int[] nums) {
        List<List<Integer>> res = new ArrayList<>();
        if (nums == null || nums.length == 0) {
            return res;
        }
        helper(res, new ArrayList<Integer>(), nums);
        return res;
    }

    private void helper(List<List<Integer>> res, List<Integer> list, int[] nums) {
        if (list.size() == nums.length) {
            res.add(new ArrayList<>(list));
            return;
        }
        for (int num : nums) {
            if (list.contains(num)) {
                continue;
            }
            list.add(num);
            helper(res, list, nums);
            list.remove(list.size() - 1);
        }
    }
}

2. 有重复的整数，全排列

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

public class LC47 {
    public List<List<Integer>> permute(int[] nums) {
        List<List<Integer>> res = new ArrayList<>();
        if (nums == null || nums.length == 0) {
            return res;
        }
        Arrays.sort(nums);
        helper(res, new ArrayList<>(), nums, new boolean[nums.length]);
        return res;
    }

    private void helper(List<List<Integer>> res, List<Integer> list, int[] nums, boolean[] used) {
        if (list.size() == nums.length) {
            res.add(new ArrayList<>(list));
            return;
        }

        for (int i = 0; i < nums.length; i++) {
            // 如果使用过就跳过
            if (used[i]) continue;
            // 去重
            if (i > 0 && nums[i] == nums[i - 1] && used[i - 1]) continue;
            used[i] = true;
            list.add(nums[i]);
            helper(res, list, nums, used);
            list.remove(list.size() - 1);
            used[i] = false;
        }
    }
}

3. 无重复的字符串，全排列

import java.util.ArrayList;

public class LC46_String {
    public ArrayList<String> permuteUnique(String str) {
        ArrayList<String> res = new ArrayList<>();
        if (str.length() == 0) {
            return res;
        }
        char[] chars = str.toCharArray();
        helper(res, new StringBuilder(), chars);
        return res;
    }

    private void helper(ArrayList<String> res, StringBuilder s, char[] chars) {
        if (s.length() == chars.length) {
            res.add(s.toString());
            return;
        }
        for (char c : chars) {
            if (s.toString().contains(String.valueOf(c))) {
                continue;
            }
            s.append(c);
            helper(res, s, chars);
            s.deleteCharAt(s.length() - 1);
        }
    }
}

4. 有重复的字符串，全排列

import java.util.ArrayList;
import java.util.Arrays;

public class LC47_String {
    public ArrayList<String> permute(String str) {
        ArrayList<String> res = new ArrayList<>();
        if (str.length() == 0) {
            return res;
        }
        char[] chars = str.toCharArray();
        Arrays.sort(chars);
        helper(res, new StringBuilder(), chars, new boolean[chars.length]);
        return res;
    }

    private void helper(ArrayList<String> res, StringBuilder s, char[] chars, boolean[] used) {
        if (s.length() == chars.length) {
            res.add(s.toString());
            return;
        }
        for (int i = 0; i < chars.length; i++) {
            if (used[i]) {
                continue;
            }
            if (i > 0 && chars[i] == chars[i - 1] && used[i - 1]) {
                continue;
            }
            used[i] = true;
            s.append(chars[i]);
            helper(res, s, chars, used);
            s.deleteCharAt(s.length() - 1);
            used[i] = false;
        }
    }
}