Method
findRowSum
(int grid[][], int r, int c)
Source from the content-addressed store, hash-verified
| 1 | class Solution { |
| 2 | public int findRowSum(int grid[][], int r, int c){ |
| 3 | boolean visited[] = new boolean[10]; |
| 4 | int sum=0; |
| 5 | for(int i=0;i<3;i++){ |
| 6 | int rowSum=0; |
| 7 | for(int j=0;j<3;j++){ |
| 8 | int val = grid[r+i][c+j]; |
| 9 | if(val==0 || val>=10 || visited[val]){ |
| 10 | return -1; |
| 11 | } |
| 12 | visited[val] = true; |
| 13 | rowSum+=val; |
| 14 | } |
| 15 | if(i==0){ |
| 16 | sum = rowSum; |
| 17 | }else{ |
| 18 | if(sum!=rowSum){ |
| 19 | return -1; |
| 20 | } |
| 21 | } |
| 22 | } |
| 23 | return sum; |
| 24 | } |
| 25 | |
| 26 | public int findColSum(int grid[][], int r, int c){ |
| 27 | int sum=0; |
Tested by
no test coverage detected