Sudoku

这道题乍一看没什么思路一开始以为就是暴力模拟后来写了一半发现我的想法有局限性，然后想了想找到了一种暴力的搜索写法。直接每个格子从1到9的枚举如果可以就接着往后搜不行的话就回溯并把回溯的值往后枚举直到搜完所以格子答案就出来了。虽然暴力但是题目的数据范围比较小大致算了一下时间复杂度够就写了。ac代码如下。

#include<iostream>
#include<cstring>
using namespace std;
char a[12][12];
int box1[10][10],box2[10][10],box3[10][10],b[12][12],flag;
void dfs(int i,int j){
	if(flag==1){
		return;
	}
	if(b[i][j]!=0){
		if(j!=9){
			dfs(i,j+1);
		}else if((i!=9)&&(j==9)){
			dfs(i+1,1);
		}else{
			flag=1;
		}
		return;
	}
	for(int x=1;x<=9;x++){
		if((i<=3)&&(j<=3)){
			if((box1[1][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[1][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				dfs(i,j+1);
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[1][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i<=3)&&(j>=4)&&(j<=6)){
			if((box1[2][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[2][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				dfs(i,j+1);
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[2][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i<=3)&&(j>=7)&&(j<=9)){
			if((box1[3][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[3][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				if(i!=9&&j==9){
					dfs(i+1,1);
				}else{
					dfs(i,j+1);
				}
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[3][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i>=4)&&(i<=6)&&(j<=3)){
			if((box1[4][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[4][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				dfs(i,j+1);
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[4][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i>=4)&&(i<=6)&&(j>=4)&&(j<=6)){
			if((box1[5][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[5][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				dfs(i,j+1);
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[5][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i>=4)&&(i<=6)&&(j>=7)&&(j<=9)){
			if((box1[6][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[6][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				if(i!=9&&j==9){
					dfs(i+1,1);
				}else{
					dfs(i,j+1);
				}
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[6][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i>=7)&&(i<=9)&&(j<=3)){
			if((box1[7][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[7][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				dfs(i,j+1);
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[7][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i>=7)&&(i<=9)&&(j>=4)&&(j<=6)){
			if((box1[8][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[8][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				dfs(i,j+1);
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[8][x]=box2[i][x]=box3[j][x]=0;
			} 
		}else if((i>=7)&&(i<=9)&&(j>=7)&&(j<=9)){
			if((box1[9][x]==0)&&(box2[i][x]==0)&&(box3[j][x]==0)){
				box1[9][x]=box2[i][x]=box3[j][x]=1;
				b[i][j]=x;
				if(i!=9&&j==9){
					dfs(i+1,1);
				}else if(j!=9){
					dfs(i,j+1);
				}else if(i==9&&j==9){
					flag=1;
				} 
				if(flag==1){
					return;
				}
				b[i][j]=0;
				box1[9][x]=box2[i][x]=box3[j][x]=0;
			} 
		}
	}
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		memset(box1,0,sizeof(box1));
		memset(box2,0,sizeof(box2));
		memset(box3,0,sizeof(box3));
		for(int i=1;i<=9;i++){
			for(int j=1;j<=9;j++){
				cin>>a[i][j];
				b[i][j]=a[i][j]-'0';
				if(b[i][j]){
					if(i<=3&&j<=3){
						box1[1][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i<=3&&j>=4&&j<=6){
						box1[2][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i<=3&&j>=7&&j<=9){
						box1[3][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i>=4&&i<=6&&j<=3){
						box1[4][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i>=4&&i<=6&&j>=4&&j<=6){
						box1[5][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i>=4&&i<=6&&j>=7&&j<=9){
						box1[6][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i>=7&&i<=9&&j<=3){
						box1[7][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i>=7&&i<=9&&j>=4&&j<=6){
						box1[8][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}else if(i>=7&&i<=9&&j>=7&&j<=9){
						box1[9][b[i][j]]=box2[i][b[i][j]]=box3[j][b[i][j]]=1;
					}
				}
			}
		}
		flag=0;
		dfs(1,1);
		for(int i=1;i<=9;i++){
			for(int j=1;j<=9;j++){
				printf("%d",b[i][j]);
			}
			printf("\n");
		} 
	} 
	return 0;
}

这题写完后看了看别人写的发现判断一个数在哪个小方块的9个判断其实一行就能解决所以写了很多没必要的代码。