200.岛屿数量

源码如下

class Solution {
public:
    int numIslands(vector>& grid) {
        vector > g(grid.size());
        for (int i = 0; i < grid.size(); ++i) {
            g[i].resize(grid[i].size());
            for (int j = 0; j < grid[i].size(); ++j) {
                if (grid[i][j] == '1') {
                    g[i][j] = 0;
                } else {
                    g[i][j] = -1;
                }
            }
        }
        for (int i = 0; i < grid.size(); ++i) {
            for (int j = 0; j < grid[i].size(); ++j) {
                if (!g[i][j]) {
                    mark(g, i, j);
                    cout << "------------\n";
                    tot++;
                }
            }
        }
        return tot-1;
    }
private:
    int  tot = 1;
    void mark(vector >& g, int i, int j) {
        cout << i << "\t" << j << endl;
        g[i][j] = tot;
        if (i+1 -1 && !g[i][j-1]) {
            mark(g, i, j-1);
        }
        if (i-1 > -1 && !g[i-1][j]) {
            mark(g, i-1, j);
        }
    }
};

• 四连通的经典题。
• 去检查一个1周围四个方向是否有没走过的1。同时遍历的1，标记一个数字，标记完后标记数字自加。