n0037_sudoku_solver.rs

/**
 * [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:
 *
 * <ol>
 * 	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 the digits 1-9 must occur exactly once in each of the 9 3x3 sub-boxes of the grid.
 * </ol>
 *
 * Empty cells are indicated by the character '.'.
 *
 * <img src="https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png" style="height:250px; width:250px" /><br />
 * <small>A sudoku puzzle...</small>
 *
 * <img src="https://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png" style="height:250px; width:250px" /><br />
 * <small>...and its solution numbers marked in red.</small>
 *
 * Note:
 *
 *
 * 	The given board contain only digits 1-9 and the character '.'.
 * 	You may assume that the given Sudoku puzzle will have a single unique solution.
 * 	The given board size is always 9x9.
 *
 *
 */
pub struct Solution {}

// submission codes start here

// TODO
impl Solution {
    pub fn solve_sudoku(board: &mut Vec<Vec<char>>) {}
}

// submission codes end

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_37() {}
}