Sudoku Solver

最新推荐文章于 2024-04-23 11:00:25 发布

风陵渡口

最新推荐文章于 2024-04-23 11:00:25 发布

阅读量465

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/u010993983/article/details/40107105

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Problem：

Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume that there will be only one unique solution.

A sudoku puzzle...

...and its solution numbers marked in red.

经典题了，广搜。

Solution：

public class Solution {
char[][] gboard;
boolean isSolved;
public void solveSudoku(char[][] board) {
     gboard = board;
     int i=0,j=0;
     outer:
     for(;i<9;i++)
          for(j=0;j<9;j++)
            if(gboard[i][j]=='.')
                 break outer;
     solver(i, j);
}

    private void solver(int i,int j)
    {
         boolean[] unavailable = new boolean[9];
        for(int k=0;k<9;k++)
             if(gboard[k][j]!='.')
                 unavailable[gboard[k][j]-'1'] = true;
         for(int k=0;k<9;k++)
            if(gboard[i][k]!='.')
                unavailable[gboard[i][k]-'1'] = true;
         for(int x=3*(i/3);x<3*(i/3)+3;x++)
            for(int y=3*(j/3);y<3*(j/3)+3;y++)
                if(gboard[x][y]!='.')
                     unavailable[gboard[x][y]-'1'] = true;
         for(int k=0;k<9;k++)
             if(!unavailable[k])
            {
                gboard[i][j] = Integer.toString(k+1).charAt(0);
                int m=i,n=j+1;
                outer:
                for(;m<9;m++)
                {
                     if(m>i)
                        n = 0;
                     for(;n<9;n++)
                        if(gboard[m][n]=='.')
                            break outer;
                 }
                if(m==9)
                {
                     isSolved = true;
                     return;
                 }
                 solver(m, n);
                 if(isSolved) //已经找到解，返回，不然结果会被清除
                    return;
                 gboard[i][j] = '.';
             }
        }
}