Java全排列

public class FullPermutation {

    private static List<String> ans = new LinkedList<>();

    private static List<Character> res = new LinkedList<>();

    public static void main(String[] args) {
        String s = "bba";
        char[] charArray = s.toCharArray();
        Arrays.sort(charArray);
        System.out.println(Arrays.toString(charArray));
        boolean[] visited = new boolean[s.length()];
        fullPermutation(visited, charArray, 0);
        String[] strings = new String[ans.size()];
        for (int i = 0; i < strings.length; i++) {
            strings[i] = ans.get(i);
        }
        System.out.println(Arrays.toString(strings));
    }

    private static void fullPermutation(boolean[] visited, char[] charArray, int count) {
        if (count == charArray.length) {
            StringBuilder sb = new StringBuilder();
            for (char c : res) {
                sb.append(c);
            }
            ans.add(sb.toString());
            return;
        }
        for (int i = 0; i < charArray.length; i++) {
            if (!visited[i]) {
                if (i > 0 && visited[i - 1] && charArray[i] == charArray[i - 1]) {
                    continue;
                }
                visited[i] = true;
                res.add(charArray[i]);
                fullPermutation(visited, charArray, count + 1);
                res.remove((Character) charArray[i]);
                visited[i] = false;
            }
        }
    }
}