Number of Islands

Description:

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

Code:

#define MAX 500

struct vertex
{
    int row;
    int col;
    vertex(int x, int y):row(x),col(y){
    }
};

class Solution {
private:
bool visit[MAX][MAX];
public:

    void BFSTraverse(vector<vector<char>>& grid, int i, int j)
    {
        visit[i][j] = true;
        deque<vertex>m;
        m.push_back(vertex(i,j));
        while (!m.empty())
        {
            vertex v = m.front();
            m.pop_front();
            int mRow = v.row;
            int mCol = v.col;
            for (int k = 1; k <= 4; ++k)
            {
                switch (k)
                {
                    case 1:
                        mRow = v.row-1;
                        mCol = v.col;
                        break;
                    case 2:
                        mRow = v.row+1;
                        mCol = v.col;
                        break;
                    case 3:
                        mRow = v.row;
                        mCol = v.col-1;
                        break;
                    case 4:
                        mRow = v.row;
                        mCol = v.col+1;
                        break;
                }
                if ( mRow >= 0 && mRow < grid.size() && mCol >=0 && mCol < grid[0].size() 
                && grid[mRow][mCol] == '1' && visit[mRow][mCol] == false)
                {
                    visit[mRow][mCol] = true;
                    m.push_back( vertex(mRow,mCol) );
                }
            }
        }
    }
    
    int numIslands(vector<vector<char>>& grid) {
        size_t row = grid.size();
        if (row == 0)
            return 0;
        size_t col = grid[0].size();
         //注意二维数组的初始化不可以直接用visit[MAX][MAX] = {false}，应采用for循环（memset函数似乎也可以）
        for (int i = 0; i < row; ++i)
        {
            for (int j = 0; j < col; ++j)
                visit[i][j] = false;
        }
        int result = 0;
        for (int i = 0; i < row; ++i)
        {
            for (int j = 0; j < col; ++j)
            {
                if ( grid[i][j]=='1' && visit[i][j] == false )
                {
                    ++result;
                    BFSTraverse(grid, i, j);
                }
            }
        }
        return result;
    }
};