leetcode+平时说的标记数组就是hashtable

点击打开链接

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<limits.h>
#include<assert.h>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        map<char,int>sudokuMap;
        //每行
           for(int i=0;i<9;i++){
            sudokuMap.clear();
            for(int j=0;j<9;j++){
                sudokuMap[board[i][j]]++;
                if((board[i][j]!='.')&&(sudokuMap[board[i][j]]>1)) return false;
            }
        //每列
            for(int i=0;i<9;i++){
                sudokuMap.clear();
                for(int j=0;j<9;j++){
                    sudokuMap[board[j][i]]++;
                    if((board[j][i]!='.')&&(sudokuMap[board[j][i]]>1)) return false;
                }
            }
        //每个9*9方块
            for(int i=0;i<9;i+=3){
                for(int j=0;j<9;j+=3){
                    sudokuMap.clear();
                    for(int k=i;k<i+3;k++){
                        for(int m=j;m<j+3;m++){
                            sudokuMap[board[k][m]]++;
                            if((board[k][m]!='.')&&(sudokuMap[board[k][m]]>1)) return false;
                        }
                    }
                }
            }
        }
        return true;
    }
};
int main()
{
    Solution temple;
    return 0;
}