Skip to main content

Backtracking - Question 3

Leetcode 37. Sudoku Solver

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

A sudoku solution must satisfy all of the following rules:

Each of the digits 1-9 must occur exactly once in each row.

Each of the digits 1-9 must occur exactly once in each column.

Each of the digits 1-9 must occur exactly once in each of the 9 3x3 sub-boxes of the grid.

The '.' character indicates empty cells.

Constraints:

board.length == 9

board[i].length == 9

board[i][j] is a digit or '.'.

It is guaranteed that the input board has only one solution.


Analysis:

This is a another classic backtracking question.

We can try to solve the Sudoku row by row.

Base case: if finish the last row, then we find a one solution, done;

if finish one row, we can move onto the next row;

if the current position is a number, move onto the next position;

if not a number, we can make nine trials: 1 - 9. If one of them can reach the end and return true, we find one solution, done; if none of them is valid, return false.

Pay attention to the place how to make a trial, proceed; if not find a solution, step back and start the next trial, ..., until finish all the trials (or find one solution, which can stop earlier).


See the code below:


class Solution {
public:
    void solveSudoku(vector<vector<char>>& board) {
        if(sS(board, 0, 0)) return;
    }
private:
    bool sS(vector<vector<char>>& bd, int x, int y) {
        if(x==9) return true;// find one solution
        if(y==9) return sS(bd, x+1, 0); // one row is finished, move onto the next row
        if(bd[x][y] != '.') return sS(bd, x, y+1);
        for(int i=1; i<=9; ++i) {
            if(isValid(bd, x, y, i)) {
                bd[x][y] = i + '0';// make a trial
                if(sS(bd, x, y+1)) return true;
                bd[x][y] = '.';// step back
            }
        }
        return false;// tried all possibles, but did not find one solution
    }
    bool isValid(vector<vector<char>>& bd, int x, int y, int val) {
        for(int i=0; i<9; ++i) {// check the column
            if(i == x || bd[i][y] == '.') continue;
            if(bd[i][y] == val + '0') return false;
        }
        for(int i=0; i<9; ++i) {// check the row
            if(i == y || bd[x][i] == '.') continue;
            if(bd[x][i] == val + '0') return false;
        }
        for(int i=x/3*3; i<x/3*3 + 3; ++i) {// check the 3 x 3 region
            for(int j=y/3*3; j<y/3*3 + 3; ++j) {
                if(i==x && j==y || bd[i][j] == '.') continue;
                if(bd[i][j] == val + '0') return false;
            }
        }
        return true;
    }
};

 

Upper Layer

Comments

Post a Comment

Popular posts from this blog

Binary Search - Hard Level - Question 3

Binary Search - Hard Level - Question 3 878. Nth Magical Number A positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 10^9 + 7. Analysis: Let us consider some examples first. Example 1, a = 4, b = 2. If b is dividable by a, then all the numbers which is dividable by a should be dividable by b as well. So the nth magical number should be n*b; Example 2, a = 3, b = 2. The multiples of 2 are: 2, 4, 6, 8, 10, 12, ... The multiple of 3 are: 3, 6, 9, 12, ... So the overlap is related to the minimum common multiple between a and b, and we need to remove the overlap which is double-counted. So now, we make some conclusions: 1. the upper bound of the nth magical number should be n*b, where a is the smaller one (or b <= a); 2. there are n*b/a magical numbers smaller than n*b; 3. there are n*b/(minimum common multiple) overlaps. Thus, the overall count is: n + ...
Post a Comment
Read more

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once...
Post a Comment
Read more

Recursion - Example

Recursion - Example Leetcode 231  Power of Two Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2^x Constraints: -2^31 <= n <= 2^31 - 1 Analysis: One way is to think about this question recursively: if n%2 == 1, then n must not be power of 2; if not, then we just need to consider whether (n/2) is a power of 2 or not. This is exactly the "same question with a smaller size"! It is trivial to figure out the base cases: if n == 0, return false; if n == 1, return true. See the code below: class Solution { public: bool isPowerOfTwo(int n) { // base cases if(n == 0) return false; if(n == 1) return true; // converging if(n%2 == 1) return false; return isPowerOfTwo(n/2); } }; If interested, there are some other ways to solve this problem. For example, using bit manipulation, we can have the following solution: class ...
Post a Comment
Read more