LeetCodeOJ_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 isformed by connecting adjacent lands horizontally or vertically. You may assumeall 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

 

分析：

对于每一个当前搜索到的土地，对其上下左右四个方位都进行搜索，递归进行，直到周围再无没有搜索过的土地，则岛屿个数加1。

循环执行直到所有的土地都被搜索。

需要定义一个变量存储土地的搜索状态。

 

代码：

<strong>class Solution {
public:
     void judgeOneIand(int x,int y,vector<vector<char>>& grid,vector<vector<int>>& judge_tags,int num_col,int num_row)
	{
		
		if(x<0||x>=num_col||y<0||y>=num_row)
			return;	
		if(grid.at(x).at(y)=='0')
			return;
		if(judge_tags[x][y]==1)
			return;
		else
		{
			judge_tags[x][y]=1;
			judgeOneIand(x,y+1,grid,judge_tags,num_col,num_row);
			judgeOneIand(x+1,y,grid,judge_tags,num_col,num_row);
                        judgeOneIand(x,y-1,grid,judge_tags,num_col,num_row);
			judgeOneIand(x-1,y,grid,judge_tags,num_col,num_row);
		}
	}
	
	int numIslands(vector<vector<char>>& grid) {

                int num=0;

		int num_col=grid.size();
		int num_row;
		if(num_col==0)
		   num_row=0;
		else
		   num_row=grid.at(0).size();

		vector<int> judge_tag;
		for(int j=0;j<num_row;j++)
			judge_tag.push_back(0);

		vector<vector<int>> judge_tags;
		for(int i=0;i<num_col;i++)
			judge_tags.push_back(judge_tag);
		
		int i=0;
		int j=0;
		while(i<num_col)
		{	
		    j=0;//note
			while(j<num_row)
			{
				if(grid.at(i).at(j)=='1'&&judge_tags[i][j]==0)	
				{
					//当前土地尚未被搜索，进行岛屿判断
					judgeOneIand(i,j,grid,judge_tags,num_col,num_row);
					num++;
				}
				j++;
			}
			i++;
		}

		return num;
    }

};
</strong>

后记：

1. 在编程时，遗漏了一句”j=0;//note”，导致结果错误，最后调试了很久才发现问题，像这样的错误以后尽量不要再犯。

2. 在调用函数judgeOneIand(x,y,grid,judge_tags,num_col,num_row)时，grid 、judge_tags、num_col和num_row多次传递，可以通过设置全局变量、静态变量等方式改进。