dfs算法实现——全排列输出

---

全排列输出

import java.util.Arrays;
import java.util.Scanner;

public class Main4 {
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		int []nums= {1,2,4};//这里自己改
		dfs(nums,0,3);//这里自己改，改成(0,nums.length)即可
	}

	private static void dfs(int[] nums, int p, int q) {
		if(p==q) {
			System.out.println(Arrays.toString(nums));
		}
		else {
			for(int i=p; i<nums.length; i++) {
			swap(nums,p,i);
			dfs(nums, p+1, q);
			swap(nums,p,i);
			}
		}
		
	}

	private static void swap(int[] nums, int i, int j) {
		int temp=nums[i];
		nums[i]=nums[j];
		nums[j]=temp;
	}
}

End!!!