蓝桥杯 2017java组方格取数

苦思冥想一晚上终于通过了，我的思路就是做这10个数的全排列 然后看看是否满足 相邻的格子内不能有相邻的数这个条件

格子是这样的

     0 1 2
  3 4 5 6
  7 8 9

public class AA {
static int count=0;//记录总的数量

static int[][] cc= {
//数组cc[i][j]==1 表示第i个方格与j个相邻 

{0,1,0,1,1,1,0,0,0,0},
{1,0,1,0,1,1,1,0,0,0},
{0,1,0,0,0,1,1,0,0,0},
{1,0,0,0,1,0,0,1,0,0},
{1,1,0,1,0,1,0,1,1,1},
{1,1,1,0,1,0,1,0,1,1},
{0,1,1,0,0,1,0,0,0,1},
{0,0,0,1,1,0,0,0,1,0},
{0,0,0,1,1,1,0,1,0,1},
{0,0,0,0,1,1,1,0,1,0},
};
public static void main(String[] args)
{

int [] a= {0,1,2,3,4,5,6,7,8,9};

count=0;

f(a,0);

System.out.println(count);

}


private static void f(int[] a, int k) //利用这个方法做一个全排列 
{
if(k==a.length-1)
{
if(test(a))//检查全排列后的数组是否满足题目要求
{
count++;
}


}

else
{
for(int i=k;i<a.length;i++)//交换试探并回溯
{
int t=a[k];
a[k]=a[i];
a[i]=t;

f(a,k+1);

t=a[k];
a[k]=a[i];
a[i]=t;


}

}



}


private static boolean test(int[] a) {

for(int i=0;i<a.length;i++)
{

for(int j=0;j<cc.length;j++)
{
if(cc[i][j]==1)//当我们检测到相邻的格子时
{
//这二个数(a[i]-1)，(a[i]+1) 不能出现在if块内即相邻的格子内
//如果出现返回false
if(a[j]==(a[i]-1)||a[j]==(a[i]+1))
{
return false;
}
}

}
}

return true;
}
}