Sudoku Solver

A: 回溯法解决，和八皇后一个思路。

用三个二维数组标记数字在行，列，block是否出现过。

    vector<vector<bool>> row;vector<vector<bool>> col;vector<vector<bool>> block;void solveSudoku(vector<vector<char> > &board) {// Start typing your C/C++ solution below// DO NOT write int main() functionrow.clear();col.clear();block.clear();row.resize(9,vector<bool>(9,false));col.resize(9,vector<bool>(9,false));block.resize(9,vector<bool>(9,false));for(int i=0;i<9;i++){for(int j=0;j<9;j++){if(board[i][j]=='.')continue;int num = board[i][j]-'1';row[i][num] = col[j][num] = block[(i/3)*3+j/3][num] = true;}}dfs(0,board);}bool dfs(int pos,vector<vector<char>>& board){while(pos<81&&board[pos/9][pos%9]!='.'){pos++;}if(pos==81) return true;int i = pos/9,j=pos%9;for(int num=0;num<9;num++){if(!row[i][num]&&!col[j][num]&&!block[(i/3)*3+j/3][num]){row[i][num] = col[j][num] = block[(i/3)*3+j/3][num] = true;board[i][j] = num+'1';if(dfs(pos+1,board))return true;board[i][j] = '.';row[i][num] = col[j][num] = block[(i/3)*3+j/3][num] = false;}}return false;}

转载于:https://www.cnblogs.com/summer-zhou/p/3347183.html

Sudoku Solver相关推荐

leetcode 36. Valid Sudoku | 37. Sudoku Solver（数独）
36. Valid Sudoku https://leetcode.com/problems/valid-sudoku/ 题解 class Solution {public boolean isVal ...
【DFS + backtrack】LeetCode 37. Sudoku Solver
LeetCode 37. Sudoku Solver Solution1: 转载自花花酱:http://zxi.mytechroad.com/blog/searching/leetcode-37-su ...
LeetCode Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells. Empty cells are indicated by th ...
C语言使用递归算法实现Sudoku Solver算法(附完整源码)
使用递归算法实现Sudoku Solve sudoku 结构体定义实现以下接口 C语言使用递归算法实现Sudoku Solve算法完整源码(定义,实现,main函数测试) sudoku 结构体定义 ...
LeetCode:Sudoku Solver Valid Sudouku
其实数独还是我挺喜欢的一个游戏.原来有本数独的书. 其实Sudoku是基于Valid Sudouku.其实一开始有点想太多.基于平常玩数独的经验,有很多解数独的规则.貌似这个人为判断因素比较多. 而且 ...
[LeetCode 37] Sudoku Solver回溯解法
原题: Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by ...
37. Sudoku Solver **
description: 数独 Note: Example: Example 1:Input: [["5","3",".",".& ...
37. Sudoku Solver
编写一个程序,通过已填充的空格来解决数独问题. 一个数独的解法需遵循如下规则: 数字 1-9 在每一行只能出现一次. 数字 1-9 在每一列只能出现一次. 数字 1-9 在每一个以粗实线分隔的 3x3 ...
LeetCode 37. 解数独 Sudoku Solver
编写一个程序,通过已填充的空格来解决数独问题. 一个数独的解法需遵循如下规则: 数字 1-9 在每一行只能出现一次. 数字 1-9 在每一列只能出现一次. 数字 1-9 在每一个以粗实线分隔的 3x3 ...
LeetCode Valid Sudoku
原题链接在这里:https://leetcode.com/problems/valid-sudoku/ 题目: Determine if a Sudoku is valid, according to ...

Sudoku Solver

Sudoku Solver相关推荐

最新文章

热门文章