(int r, int c, int grid[][])
| 16 | return maxFishes; |
| 17 | } |
| 18 | public int dfs(int r, int c, int grid[][]){ |
| 19 | //base case |
| 20 | //out of the matrix |
| 21 | //land cell -> 0 |
| 22 | //visited ->0 |
| 23 | if(r<0 || r>=rows || c<0 || c>= cols || grid[r][c] == 0){ |
| 24 | return 0; |
| 25 | } |
| 26 | int ans = grid[r][c]; |
| 27 | grid[r][c] = 0; |
| 28 | ans += dfs(r-1,c,grid) + dfs(r,c+1,grid) + dfs(r+1,c,grid) + dfs(r,c-1,grid); |
| 29 | return ans; |
| 30 | } |
| 31 | } |