leetcode/leet203.cpp at main · JaydeepRokade/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
class Solution {
public:
    vector<vector<int>> directions = {{0,1}, {0,-1}, {1,0}, {-1,0}};
    int findMaxFish(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        int maxFish = 0;
        for(int i = 0; i < m; i++){
            for(int j = 0; j < n; j++){
                if(grid[i][j] == 0) continue;
                maxFish = max(maxFish, dfs(grid, i, j, m, n));
            }
        }
        return maxFish;
    }
private:
    int dfs(vector<vector<int>>& grid, int i, int j, int m, int n){
        int fish = 0;
        if(grid[i][j] == 0) return fish;
        fish += grid[i][j];

        grid[i][j] = -1; // Visited

        for(const auto& dir : directions){
            int nr = i + dir[0];
            int nc = j + dir[1];
            if(nr >= 0 && nr < m && nc >= 0 && nc < n){
                if(grid[nr][nc] > 0){
                    fish += dfs(grid, nr, nc, m, n);
                }
            }
        }

        return fish;
    }
};