递归实现的蛇形排序

 public class px{
	public static final int DONG=0;
	public static final int NAN=0;
	public static final int XI=0;
	public static final int BEI=0;
	static int countNum=2;
	
	
	public static void main(String[] args)	
	{
		int local[][] =new int[countNum][countNum];
		drwa(local,1,countNum-1,DONG,0);
		for(int i=0;i<local.length;i++)
		{
			for(int j=0j<local[i].length;j++)
			{
				System.out.println(local[i][j]);
			}
			System.out.println("");
		}
	}
	
	private static void drwa(int[][] local,int begin,int count,int dir,int time)
	{
		switch(dir)
		{
		case DONG:
		for(int i=0;i<count;i++)
		{
		local[time][time+i]=begin+i;
		}
		drwa(local,count+begin,count,NAN,time);
		break;
		case NAN:
		for(int i=0;i<count;i++)
		{
		local[time+i][time+count]=begin+i;
		}
		drwa(local,count+begin,count,XI,time);
		break;
		case XI:
		for(int i=0;i<count;i++)
		{
		local[(countNum-1)-time][time+i+1]=begin-i-1;
		}
		drwa(local,count+begin,count,BEI,time);
		break;
		case BEI:
		for(int i=0;i<count;i++)
		{
		local[time+i+1][(countNum-count)/2]=begin+count-i-1;
		}
		time++;
		if(time<=(countNum/2==?countNum/2:countNum/2+1)&&count-2>=0)
		{
		drwa(local,count+begin,count-2,DONG,time);
		}else{
		if(local[time-1][time-1]==0)
		{
			local[time-1][time-1]=count+begin;
		}
		return;
		}
		break;
		}
	}
}