Leetcode 200 Number of Islands

标签：

Given a 2d grid map of ‘1‘s (land) and ‘0‘s (water), count 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:

11110
11010
11000
00000

Answer: 1

Example 2:

11000
11000
00100
00011

Answer: 3

对于任何找到的陆地，寻找四周能够到达的陆地（同一片陆地）并改变其值（这里改0）以防再次被统计到。需要注意题目输入的是字符串数组。

这里在递归方法开始前就设定条件防止越界。

def num_islands(grid)
  return 0 if not grid
  ans = 0
  grid.length.times do |i|
    grid[0].length.times do |j|
      if grid[i][j] == ‘1‘
        ans += 1
        extend(grid,i,j)
      end
    end
  end
  ans
end

def extend(grid,i,j)
  if i<grid.length and j <grid[0].length and i>=0 and j>=0 and grid[i][j] == ‘1‘
    grid[i][j] = ‘0‘
    extend(grid,i+1,j)
    extend(grid,i,j+1)
    extend(grid,i-1,j)
    extend(grid,i,j-1)
  end
end

Leetcode 200 Number of Islands

标签：

原文地址：http://www.cnblogs.com/lilixu/p/4569201.html