在的棋盘上,恰有一个方格与其他方格不同,用四种牌型覆盖整个棋盘(除特殊点),
将棋盘分割成四块,则特殊点比在这四块之一上,对无特殊点的其他块,可用一L牌来填充这三块连接处,从而每一块的处理就相同,子问题是原问题的较小模式,采用分治法递归
import java.util.Scanner;
public class qipan {
int title=1;
int[][] board =new int [100][100];
//左上角方格(tr,tc)
public void ChessBoard(int tr,int tc,int dr ,int dc,int size)
{
if(size==1){
return;
}
int t=title++;//编号先給值再加一
int s=size/2;//每次行列减半,分成四份,
if(dr<tr+s&&dc<tc+s){//特殊点在左上
ChessBoard(tr, tc, dr, dc, s);
}
else{//没有特殊点
board[tr+s-1][tc+s-1]=t;//先设置特殊点,在递归
ChessBoard(tr, tc, tr+s-1, tc+s-1, s);//特殊点变化
}
if(dr<tr+s&&dc>=tc+s){//右上
ChessBoard(tr,tc+s,dr,dc,s);
}
else{
board[tr+s-1][tc+s]=t;
ChessBoard(tr, tc+s, tr+s-1, tc+s, s);
}
if(dr>=tr+s&&dc<tc+s){
ChessBoard(tr+s,tc,dr,dc,s);
}
else{
board[tr+s][tc+s-1]=t;
ChessBoard(tr+s, tc, tr+s, tc+s-1, s);
}
if(dr>=tr+s&&dc>=tc+s){
ChessBoard(tr+s,tc+s,dr,dc,s);
}
else{
board[tr+s][tc+s]=t;
ChessBoard(tr+s, tc+s, tr+s, tc+s, s);
}
}
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
System.out.println("请输入棋盘大小(size");
int size=in.nextInt();
System.out.println("特殊棋子的位置(dr,dc");
int dr=in.nextInt();
int dc=in.nextInt();
qipan qp=new qipan();
qp.ChessBoard(0,0,dr,dc,size);
for (int i = 0; i < size; i++) {
for (int j = 0; j <size ; j++) {
System.out.printf("%5d",qp.board[i][j]);
}
System.out.println();
}
}
}