"Leetcode 36_ Hash Table" Valid Sudoku

1 //occupyed_1 Check whether rows occupy2 //occupyed_2 Check whether the column occupies3 //Occupyed_3 Check if the block is occupied4 BOOLIsvalidsudoku (vector<vector<Char>>&Board)5 {6     intoccupyed_1[9][9], occupyed_2[9][9], occupyed_3[9][9];7      for(inti =0; I <9; ++i) {8          for(intj =0; J <9; ++j) {9OCCUPYED_1[I][J] =0;TenOCCUPYED_2[I][J] =0; OneOCCUPYED_3[I][J] =0; A         } -     } -  the     intRowsize =board.size (); -     intColsize = board[0].size (); -      for(inti =0; i < rowsize; ++i) { -          for(intj =0; J < Colsize; ++j) { +             if(Board[i][j]! ='.') { -                 intnum = board[i][j]-'0'-1; +                 intK = I/3*3+ J/3; A  at                 if(Occupyed_1[i][num] | |Occupyed_2[j][num] -||Occupyed_3[k][num]) -                     return false; -Occupyed_1[i][num] =1; -Occupyed_2[j][num] =1; -Occupyed_3[k][num] =1; in             } -         } to     } +     return true; -}

"Leetcode 36_ Hash Table" Valid Sudoku