鸳鸯谱

package lianxi;

import java.util.Arrays;

public class a {
	public static void main(String[] args)
	{
		int[] a={1,2,3};
		fullsort(a,0,a.length-1);
		
	}
	public static void fullsort(int[] a,int start,int end)
	{
		if(start==end)
		{
			if(a[0]!=1&&a[2]!=1&&a[2]!=3)
			{
				System.out.print(Arrays.toString(a));
			}
		}
		else
		{
			for(int i=start;i<=end;i++)
			{
				swap(a,start,i);
				fullsort(a,start+1,end);
				swap(a,start,i);
			
			}
		}
		
	}

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

}