840. Magic Squares In Grid

 class Solution
 {
 public:
     int numMagicSquaresInside(vector<vector<int>>& grid)
     {

         int count=;
         int szx=grid.size();
         int szy=grid[].size();
         for(int i=;i<szx-;i++)
         {
             for(int j=;j<szy-;j++)
             {
                 if(grid[i+][j+]==&&judge(grid,i,j))
                     count++;
             }
         }
         return count;
     }

     bool judge(vector<vector<int>> &grid,int i,int j)
     {
         if(grid[i][j]==)                     //check there are duplicates or not
             return false;
         for(int x=i;x<i+;x++)                 //judge cur num biggerthan 9 or not,if yes,return false
         {
             for(int y=j;y<j+;y++)
             {
                 int curele=grid[x][y];
                 if(curele>)
                     return false;
             }
         }
         for(int x=i;x<i+;x++)                //judge every row's sum is 15 or not
         {
             if(grid[x][j]+grid[x][j+]+grid[x][j+]!=)
                 return false;
         }
         for(int y=j;y<j+;y++)               //judge every col's sum is 15 or not
         {
             if(grid[i][y]+grid[i+][y]+grid[i+][y]!=)
                 return false;
         }
         if(grid[i][j]+grid[i+][j+]+grid[i+][j+]!=)   //judge diagonals
             return false;
         if(grid[i+][j]+grid[i+][j+]+grid[i][j+]!=)
             return false;
         return true;
     }
 };

基本上是暴力解法，问题不大