(int grid[][], int r, int c)
| 43 | } |
| 44 | |
| 45 | public int diagonalSum(int grid[][], int r, int c){ |
| 46 | int sum1 = grid[r][c] + grid[r+1][c+1] + grid[r+2][c+2]; |
| 47 | int sum2 = grid[r][c+2] + grid[r+1][c+1] + grid[r+2][c]; |
| 48 | if(sum1==sum2){ |
| 49 | return sum1; |
| 50 | } |
| 51 | return -1; |
| 52 | } |
| 53 | public boolean isMagicSquare(int grid[][], int r, int c){ |
| 54 | int rowSum = findRowSum(grid,r,c); //3*3 |
| 55 | if(rowSum==-1) return false; |