LeetCode 1. 10 有效的数独

#include <iostream>
#include <time.h>
#include <stdio.h> 
#include <set>
#include<vector>
#include<map>
using namespace std;

bool square_(int pad, int mag,vector<vector<char>>& board) {
    map<char, int> m;
    m.clear();
    int i, j;
    bool ok=1;
    for (i=pad; i < pad+3; ++i) {
        for (j=mag; j < mag+3; ++j)
        {
            if (m[board[i][j]] == 0) {
                if (board[i][j] != '.')
                m[board[i][j]]++;
            }
            else {
            //    cout << "(" << i << " , " << j << ")" << board[i][j] << "方格重复!" << endl;
                ok = 0;
                return ok;
            }
        }
    }
    return ok;
}
bool isValidSudoku(vector<vector<char>>& board) {
    bool ok=1;//默认成功
    map<char, int> m; 
    //纵向*9
    for (size_t i = 0; i < 9; ++i) {
        m.clear();
        for (size_t j = 0; j < 9; ++j) {
            if (m[board[j][i]] == 0){
                if(board[j][i]!='.')
                m[board[j][i]]++;}
            else {
            //    cout <<"("<<j<<" , "<<i<<")"<< board[j][i] << "纵向重复!" << endl;
                ok = 0;
                return ok ;
            }
        }
    }
    //横向*9
    for (size_t i = 0; i < 9; ++i) {
        m.clear();
        for (size_t j = 0; j < 9; ++j) {
            if (m[board[i][j]] == 0) {
                if (board[i][j] != '.')
                m[board[i][j]]++;
            }
            else {
            //    cout << "(" << i << " , " << j<< ")" << board[i][j] << "横向重复!" << endl;
                ok = 0;
                return ok;
            }
        }
    }
    //小方格*9
    int i = 0; int j = 0; int pad=0; int mag = 0;
    for (j = 0; j < 3; ++j) {
        for (i = 0; i < 3; i++)
        {
            ok = square_(pad, mag, board);
            if (ok == 0)
                return ok;
            pad += 3;
        }
        mag += 3;
        pad = 0;
    }
    return ok;
}

int main()
{
    vector<vector<char>> v1;
    vector<char> v2;
    int n;
    char x;
    printf("输入数独: 
");
    //scanf("%d", &n);
    for (size_t j = 0; j < 9; ++j) {
        v2.clear();
        for (size_t i = 0; i < 9; ++i)
        {
            while (1) {
                scanf("%c", &x);
                if ((x >= '1' && x <= '9') || x == '.')
                    break;
            }
            v2.push_back(x);
        }
        v1.push_back(v2);
    }

    
    bool ans = isValidSudoku(v1);
        cout <<ans << endl;
    //cout << endl;
    return 0;
}