打印一个字符串的全排列 (递归)

思路

代码实现

package digui;

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

public class Code04_PrintAllPermutations {
    // 不好的递归
    public static List<String> permutation1(String s) {
        List<String> ans = new ArrayList<>();
        if (s == null || s.length() == 0) return ans;
        char[] str = s.toCharArray();
        ArrayList<Character> rest = new ArrayList<>();
        for (char c : str) {
            rest.add(c);
        }
        String path = "";
        f(rest, path, ans);
        return ans;
    }

    public static void f(ArrayList<Character> rest, String path, List<String> ans) {
        if (rest.isEmpty()) {
            ans.add(path);
        } else {
            int N = rest.size();
            for (int i = 0; i < N; i++) {
                Character c = rest.get(i);
                rest.remove(i);
                f(rest, path + c, ans);
                rest.add(i, c);
            }
        }
    }

    // 改进的递归
    public static List<String> permutation2(String s) {
        List<String> res = new ArrayList<>();
        if (s == null || s.length() == 0) return res;
        char[] str = s.toCharArray();
        g1(str, 0, res);
        return res;
    }

    private static void g1(char[] str, int index, List<String> ans) {
        if (index == str.length) {
            ans.add(String.valueOf(str));
        } else {
            for (int i = index; i < str.length; i++) {
                swap(str, i, index);
                g1(str, index + 1, ans);
                swap(str, i, index);
            }
        }
    }

    // 去重的递归
    public static List<String> permutation3(String s) {
        List<String> res = new ArrayList<>();
        if (s == null || s.length() == 0) return res;
        char[] str = s.toCharArray();
        g2(str, 0, res);
        return res;
    }

    private static void g2(char[] str, int index, List<String> ans) {
        if (index == str.length) {
            ans.add(String.valueOf(str));
        } else {
            boolean[] visited = new boolean[256];
            for (int i = index; i < str.length; i++) {
                if (!visited[str[i]]) {
                    visited[str[i]] = true;
                    swap(str, i, index);
                    g2(str, index + 1, ans);
                    swap(str, i, index);
                }
            }
        }
    }

    public static void swap(char[] chs, int i, int j) {
        char tmp = chs[i];
        chs[i] = chs[j];
        chs[j] = tmp;
    }

    public static void main(String[] args) {
        String s = "abaa";
        List<String> ans1 = permutation1(s);
        for (String str : ans1) {
            System.out.println(str);
        }
        System.out.println("=======");
        List<String> ans2 = permutation2(s);
        for (String str : ans2) {
            System.out.println(str);
        }
        System.out.println("=======");
        List<String> ans3 = permutation3(s);
        for (String str : ans3) {
            System.out.println(str);
        }
    }
}