leetcode题解：Number of Islands

题号200

题意：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.

难度:Medium

解题思路：看到题目很容易想到利用深度优先搜索划分区域。具体而言，用一个和地图大小相同的二维数组book来标记。遍历地图，从一个还没有标记过的“1”开始，在上下左右四个方向进行搜索，每当搜索到一个可达的“1”，就在book数组相同位置进行标记。如此一来，每个起点开始可以搜索到所有满足条件的可达区域，对于每一个没有被标记过的起始点而言，岛屿数量增加1. 

class Solution {
public:
     int numIslands(vector<vector<char>>& grid) {
        if(grid.size()==0)
        return 0;
        int m=grid[0].size();
        int n=grid.size();
        int ans=0;
        vector<vector<int>> book;
        vector<int> line;
        for(int i = 0;i<m;i++)
        {
            line.push_back(0);
        }
        for(int j =0;j<n;j++)
        {
            book.push_back(line);
        }
        
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				if(book[i][j]==0&&grid[i][j]=='1')
				{
					ans++;
					book[i][j]=1;
					dfs(m,n,i,j,grid,book);
				}
			}
		}		
        return ans;
    }
    void dfs(int m,int n,int h,int z,vector<vector<char>>& map,vector<vector<int>>& book)
    {
        int dirx[3]={0,1,-1};
        int diry[3]={0,1,-1};

				for(int i=0;i<3;i++)
				{
				  for(int j=0;j<3;j++)
					{   
					    if(dirx[i]==diry[j]||dirx[i]==-diry[j])
					    continue;
					    int x=dirx[i]+h;
					    int y=diry[j]+z;

	
					    if(x<n&&y<m&&x>=0&&y>=0&&map[x][y]=='1'&&book[x][y]==0)
					    {
		
					    	book[x][y]=1;
						    dfs(m,n,x,y,map,book);
						
					    }
					}
				}
			
    }
};