DataStructures-Algorithms/Striver Sheet/Day-23/Number of Islands.cpp at master · arjunkumar09/DataStructures-Algorithms · 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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*
Number of Islands
=================

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:
Input: grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
Output: 1

Example 2:
Input: grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
Output: 3

Constraints:
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] is '0' or '1'.
*/

class Solution
{
public:
  void dfs(vector<vector<char>> &grid, int i, int j)
  {
    if (i < 0 || j < 0 || i >= grid.size() || j >= grid[0].size() || grid[i][j] != '1')
      return;

    grid[i][j] = '0';
    dfs(grid, i + 1, j); //DOWN
    dfs(grid, i, j + 1); //RIGHT
    dfs(grid, i - 1, j); //TOP
    dfs(grid, i, j - 1); //LEFT
  }

  int numIslands(vector<vector<char>> &grid)
  {
    int ans = 0;
    for (int i = 0; i < grid.size(); ++i)
    {
      for (int j = 0; j < grid[0].size(); ++j)
      {
        if (grid[i][j] == '1')
        {
          dfs(grid, i, j);
          ans++;
        }
      }
    }
    return ans;
  }
};