Simple || Clean || Java Solution
\njava []\npublic class Solution {\n    int max = 0, cur = 0;\n    public int findMaxFish(int[][] grid) {\n        for(int i=0; i<grid.length; i++){\n          
\n```java []\npublic class Solution {\n    int max = 0, cur = 0;\n    public int findMaxFish(int[][] grid) {\n        for(int i=0; i<grid.length; i++){\n            for(int j=0; j<grid[0].length; j++){\n                if(grid[i][j] == 0) continue;\n                pass(grid, i, j);\n                cur = 0;\n            }\n        }\n        return max;\n    }\n    void pass(int[][] grid, int i, int j){\n        if(i < 0 || j < 0 || i >= grid.length || j >= grid[0].length || grid[i][j] == 0)    return;\n        cur += grid[i][j];\n        grid[i][j] = 0;\n        max = Math.max(max,cur);\n        pass(grid, i+1, j);\n        pass(grid, i-1, j);\n        pass(grid, i, j+1);\n        pass(grid, i, j-1);\n    }\n}\n\n```
['Java']