快手9.16笔试

1.有效数独 leetcode36

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

数独部分空格内已填入了数字，空白格用 '.' 表示。
示例 :

输入:
[
  ["8","3",".",".","7",".",".",".","."],
  ["6",".",".","1","9","5",".",".","."],
  [".","9","8",".",".",".",".","6","."],
  ["8",".",".",".","6",".",".",".","3"],
  ["4",".",".","8",".","3",".",".","1"],
  ["7",".",".",".","2",".",".",".","6"],
  [".","6",".",".",".",".","2","8","."],
  [".",".",".","4","1","9",".",".","5"],
  [".",".",".",".","8",".",".","7","9"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。
         但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

说明:

①一个有效的数独（部分已被填充）不一定是可解的。
②只需要根据以上规则，验证已经填入的数字是否有效即可。
③给定数独序列只包含数字 1-9 和字符 '.' 。
④给定数独永远是 9x9 形式的。

采用了静态数组，也可以考虑使用哈希表。

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        vector<vector<int>>row(9,vector<int>(10,0));//检验行
        vector<vector<int>>column(9,vector<int>(10,0));//检验列
        vector<vector<int>>box(9,vector<int>(10,0));//检验每个3x3小方块
        for(int i=0;i<9;i++){
            for(int j=0;j<9;j++){
                if(board[i][j]=='.'){
                    continue;
                }
                int temp=board[i][j]-'0';
                int box_num=(i/3)*3+j/3;//从左到右 从上到下对9个小方格编号
                if(row[i][temp]==0&&column[j][temp]==0&&box[box_num][temp]==0){
                    row[i][temp]=1;
                    column[j][temp]=1;
                    box[box_num][temp]=1;
                }else{
                    return false;
                }
            }
        }
        return true;
    }
};

2.编辑距离 leetcode72