LeetCode刷题：200. 岛屿数量（golang版）

• 题目描述

给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。
岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外，你可以假设该网格的四条边均被水包围。

示例 1：
输入：grid = [
  ["1","1","1","1","0"],
  ["1","1","0","1","0"],
  ["1","1","0","0","0"],
  ["0","0","0","0","0"]
]
输出：1

示例 2：
输入：grid = [
  ["1","1","0","0","0"],
  ["1","1","0","0","0"],
  ["0","0","1","0","0"],
  ["0","0","0","1","1"]
]
输出：3

提示：
m == grid.length
n == grid[i].length
1 <= m, n <= 300
grid[i][j] 的值为 '0' 或 '1'

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/number-of-islands
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

• 思路
  1、染色思想，遍历grid，若grid[i][j]==1，则将其与其上下左右节点都染色，即将他们的值都赋值为0，注意这一步需要递归处理，可以DFS或BFS
  2、再次遍历grid，这次统计值依旧为1的个数即可
• 代码

package main

import "fmt"

func numIslands(grid [][]byte) int {
	nums := 0
	for i:=0; i<len(grid); i++ {
		for j:=0; j<len(grid[0]); j++ {
			if grid[i][j] == '1' {
				DFS(&grid,i,j)
				nums ++
			}
		}
	}
	return nums
}

func DFS(grid *[][]byte, i int, j int)  {
	var (
		row = len(*grid)
		col = len((*grid)[0])
	)
	if i < 0 || i >= row || j < 0 || j >= col {
		return
	}
	if (*grid)[i][j] == '1' {
		(*grid)[i][j] = '0'
		DFS(grid,i-1,j)
		DFS(grid,i+1,j)
		DFS(grid,i,j-1)
		DFS(grid,i,j+1)
	}
}

func main() {
	var grid = make([][]byte, 4)
	grid[0] = []byte{'1','1','0','0','0'}
	grid[1] = []byte{'1','1','0','0','0'}
	grid[2] = []byte{'0','0','1','0','0'}
	grid[3] = []byte{'0','0','0','1','1'}

	res := numIslands(grid)
	fmt.Println(res)
}