[Leetcode/c++] 37解数独

题目

编写一个程序，通过已填充的空格来解决数独问题。

一个数独的解法需遵循如下规则：

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
空白格用 ‘.’ 表示。

DFS

经典问题， 一个个试着去填， 能填完就是对的。

代码

1. CPP

#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define rep(i,a,n) for(int i=a; i<n; i++)
#define per(i,a,n) for(int i=n-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<VI> VVI;
typedef vector<VC> VVC;
typedef long long ll;
typedef pair<int, int> PII;
typedef unordered_map<int, int> MII;
typedef double db;
ll gcd(ll a, ll b){return b?gcd(a%b, b):a;}
const ll mod = 1000000007;
// head
class Solution {
public:
    int n = 9;
    void solveSudoku(vector<vector<char>>& board) {
        dfs(board);
    }
    bool dfs(vector<vector<char>>& board) {
        rep(i, 0, n) rep(j, 0, n) if(board[i][j] == '.'){
            rep(ch, 1, 10)  {
                char x = ch + '0';
                if(valid(x, i, j, board)){
                    board[i][j] = x;
                    if(dfs(board)) return true;
                    board[i][j] = '.';
                }
            }
            return false;
        }
        return true;
    }
    bool valid(char x, int i, int j, vector<vector<char>> & board){
        // row and col
        rep(k, 0, 9) if(board[i][k] == x && k != j) return false;
        rep(k, 0, 9) if(board[k][j] == x && k != i) return false;
        int r = i / 3;
        int c = j / 3;
        rep(dx, 0, 3) rep(dy, 0, 3) {
            int ni = r * 3 + dx;
            int nj = c * 3 + dy;
            if(board[ni][nj] == x && (ni != i || nj != j)) return false;
        }
        return true;
    }
};

2. Scala

object Solution {
  def solveSudoku(board: Array[Array[Char]]): Unit = {
    solver(board)
  }
  def solver(board: Array[Array[Char]]): Boolean ={
    for(i <- 0 to 8; j <- 0 to 8 if board(i)(j).equals('.')){
      for(t <- '1' to '9' if isValid(board,i,j,t)){
        board(i)(j) = t
        if(solver(board)) return true
        else board(i)(j) = '.'
      }
        return false
    }
    true
  }

  def isValid(board: Array[Array[Char]], i: Int, j : Int, num : Char) : Boolean = {
      isRowValid(board,i,j,num) && isColValid(board,i,j,num) && isSqdValid(board, i, j, num)
  }

  def isSqdValid(board: Array[Array[Char]], row: Int, col : Int, num : Char) : Boolean = {
    !subBoard(board, (x , y) => y >= col / 3 *3 && y < col /3 *3+ 3 && x >= row / 3 * 3 && x < row /3 * 3 +3 ).contains(num)
  }

  def isRowValid(board: Array[Array[Char]], row: Int, col : Int, num : Char) : Boolean = {
    !subBoard(board, (x , y) => x == row).contains(num)
  }
  def isColValid(board: Array[Array[Char]], row: Int, col : Int, num : Char) : Boolean = {
    !subBoard(board, (x , y) => y == col).contains(num)
  }

  def subBoard(board:Array[Array[Char]], p: (Int,Int)=>Boolean) : Array[Char] = {
    (for (i <- 0 to 8; j <- 0 to 8 if p(i, j)) yield board(i)(j)).toArray
  }
}