全排列

dfs的思想

package Suanfa;

import java.util.*;

public class 全排列 {

	static HashSet<String> set = new HashSet<>();

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String temp="abc";
		全排列(temp.toCharArray(), 0, temp.length());
		Iterator<String>iterator=set.iterator();
		while(iterator.hasNext()){
			System.out.println(iterator.next());
		}
	}

	public static void 全排列(char[] arr, int start, int length) {
		if (start == length) {
			set.add(String.valueOf(arr));

		} else {
			for (int i = start; i < length; i++) {
				swap(arr, start, i);
				全排列(arr, start + 1, length);
				swap(arr, start, i);
			}
		}
	}

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

}