Leetcode 200. 岛屿数量（DAY 92) ---- Leetcode Hot 100

Love 6

已于 2022-12-02 23:44:06 修改

阅读量271

点赞数

分类专栏：从c++开始的进步之路 # Leetcode算法之路-Medium 文章标签： c++

于 2021-04-21 15:29:03 首次发布

本文链接：https://blog.csdn.net/qq_37500516/article/details/115957065

版权

从c++开始的进步之路同时被 2 个专栏收录

561 篇文章 50 订阅

订阅专栏

Leetcode算法之路-Medium

387 篇文章 3 订阅

订阅专栏

文章目录

原题题目

在这里插入图片描述

代码实现（首刷自解）

class Solution {
public:

    void dfs(vector<vector<char>>& grid,int x,int y,int xsize,int ysize)
    {
        if(!(grid[x][y]-'0') || !(grid[x][y]-'2'))    return;
        grid[x][y] = '2';
        if(x+1<xsize) dfs(grid,x+1,y,xsize,ysize);
        if(y+1<ysize) dfs(grid,x,y+1,xsize,ysize);
        if(x>=1) dfs(grid,x-1,y,xsize,ysize);
        if(y>=1) dfs(grid,x,y-1,xsize,ysize); 
        return;
    }

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

代码实现（二刷自解 C++ DAY 154）

class Solution {
public:
    void depthfirstsearch(vector<vector<bool>>& visit,vector<vector<char>>& grid,int x,int y)
    {
        if(x<0 || y<0 || x >= grid.size() || y>=grid[0].size() ||  grid[x][y] == '0' || visit[x][y]) return;
        visit[x][y] = true;
        depthfirstsearch(visit,grid,x,y+1);
        depthfirstsearch(visit,grid,x+1,y);
        depthfirstsearch(visit,grid,x-1,y);
        depthfirstsearch(visit,grid,x,y-1);
    }

    int numIslands(vector<vector<char>>& grid) {
        vector<vector<bool>> visit(grid.size(),vector<bool> (grid[0].size(),false));
        int ret = 0;
        for(int x=0;x<grid.size();++x)
        {
            for(int y=0;y<grid[0].size();++y)
            {
                if(grid[x][y] == '1' && !visit[x][y])
                {
                    depthfirstsearch(visit,grid,x,y);
                    ++ret;
                }   
            }
        }
        return ret;
    }
};

代码实现（三刷自解 DAY 222 C++）

class Solution {
public:
    void bfs(vector<vector<char>>& grid,vector<vector<bool>>& visit,int x,int y)
    {
        if(x < 0 || x >= grid.size() || y < 0 || y >= grid[0].size() || \
           grid[x][y] == '0' || visit[x][y])    return;

        visit[x][y] = true;
        bfs(grid,visit,x+1,y);
        bfs(grid,visit,x,y+1);
        bfs(grid,visit,x-1,y);
        bfs(grid,visit,x,y-1);

        return;
    }

    int numIslands(vector<vector<char>>& grid) {
        vector<vector<bool>> visit(grid.size(),vector<bool>(grid[0].size(),false));
        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')
                {
                    if(visit[i][j] == false)
                    {
                        ++ans;
                        bfs(grid,visit,i,j);
                    }
                }
            }
        }

        return ans;
    }
};

代码实现（四刷自解 DAY 233 C++）

class Solution {
public:
    void depth_first_search(vector<vector<char>>& grid,int x,int y)
    {
        if(x < 0 || x >= grid.size() || y < 0 || y >= grid[0].size() || grid[x][y] == '0')
            return;
        
        grid[x][y] = '0';
        depth_first_search(grid,x+1,y);
        depth_first_search(grid,x-1,y);
        depth_first_search(grid,x,y+1);
        depth_first_search(grid,x,y-1);

        return;
    }

    int numIslands(vector<vector<char>>& grid) {
        int row_size = grid.size(),line_size = grid[0].size();
        int ret = 0;
        for(int i = 0;i < row_size;++i)
        {
            for(int j = 0;j < line_size;++j)
            {
                if(grid[i][j] == '1')
                {
                    ++ret;
                    depth_first_search(grid,i,j);
                }
            }
        }

        return ret;
    }
};

代码实现（五刷自解 DAY 271 C++）

class Solution {
public:
    void DepthFirstSearch(vector<vector<char>>& grid, int x, int y)
    {
      if (x < 0 || x >= grid.size() || 
          y < 0 || y >= grid[0].size() || 
          grid[x][y] == '0') { 
            return;
      }
      
      grid[x][y] = '0';
      DepthFirstSearch(grid, x + 1, y);
      DepthFirstSearch(grid, x - 1, y);
      DepthFirstSearch(grid, x, y + 1);
      DepthFirstSearch(grid, x, y - 1);
      return;
    }

    int numIslands(vector<vector<char>>& grid) {
      int ret = 0;
      int xsize = grid.size(), ysize = grid[0].size();
      for (int x = 0; x < xsize; ++x) {
        for (int y = 0; y < ysize; ++y) {
          if (grid[x][y] == '1') {
            ++ret;
            DepthFirstSearch(grid,x,y);
          }
        }
      }

      return ret;
    }
};

代码实现（六刷自解 DAY 2 Golang）

func DepthFirstSearch(grid [][]byte, x, y int) {
  if x < 0 || x >= len(grid) || y < 0 || y >= len(grid[0]) || grid[x][y] == '0' {
    return
  }

  grid[x][y] = '0'
  DepthFirstSearch(grid, x + 1, y)
  DepthFirstSearch(grid, x - 1, y)
  DepthFirstSearch(grid, x, y - 1)
  DepthFirstSearch(grid, x, y + 1)
  return
}

func numIslands(grid [][]byte) int {
  ret := 0

  for x, row := range grid {
    for y, num := range row {
      if num == '1' {
        ret++
        DepthFirstSearch(grid, x, y)
      }
    }
  }

  return ret
}