200. 岛屿数量（并查集、DFS）

200. 岛屿数量

方法一、DFS或BFS

遍搜索遍改变，访问数组也不需要

class Solution {
	int res = Integer.MIN_VALUE;
	int[][] dir = new int[][] { { 0, 1 }, { 0, -1 }, { 1, 0 }, { -1, 0 } };
	int r;
	int c;

	public int numIslands(char[][] grid) {
        if(grid.length == 0)
            return 0;
		r = grid.length;
		c = grid[0].length;
        int res = 0;
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				if (grid[i][j] == '1') {
					dfs(i, j, grid);
					res ++;
				}
			}
		}
		return res;
	}

	public void dfs(int i, int j, char[][] grid) {
		grid[i][j] = '0';
		for (int[] d : dir) {
			int newx = i + d[0];
			int newy = j + d[1];
			if (newx >= 0 && newx < r && newy >= 0 && newy < c) {
				if(grid[newx][newy] == '1')
					dfs(newx, newy, grid);
			}
		}
		return;
	}
}

方法二、并查集

海洋一定是连接在一起的，所以初始化的时候全部为0，其余陆地初始化为自身标号，搜索时连接。

官解

class Solution {
	class UnionFind {
		int count; // # of connected components
		int[] parent;
		int[] rank;

		public UnionFind(char[][] grid) { // for problem 200
			count = 0;
			int m = grid.length;
			int n = grid[0].length;
			parent = new int[m * n];
			rank = new int[m * n];
			for (int i = 0; i < m; ++i) {
				for (int j = 0; j < n; ++j) {
					if (grid[i][j] == '1') {
						parent[i * n + j] = i * n + j;
						++count;
					}
					rank[i * n + j] = 0;
				}
			}
		}

		public int find(int i) { // path compression
			if (parent[i] != i)
				parent[i] = find(parent[i]);
			return parent[i];
		}

		public void union(int x, int y) { // union with rank
			int rootx = find(x);
			int rooty = find(y);
			if (rootx != rooty) {
				if (rank[rootx] > rank[rooty]) {
					parent[rooty] = rootx;
				} else if (rank[rootx] < rank[rooty]) {
					parent[rootx] = rooty;
				} else {
					parent[rooty] = rootx;
					rank[rootx] += 1;
				}
				--count;
			}
		}

		public int getCount() {
			return count;
		}
	}

	public int numIslands(char[][] grid) {
		if (grid == null || grid.length == 0) {	//特判
			return 0;
		}

		int nr = grid.length;
		int nc = grid[0].length;
		UnionFind uf = new UnionFind(grid);
		for (int r = 0; r < nr; ++r) {
			for (int c = 0; c < nc; ++c) {
				if (grid[r][c] == '1') {
					grid[r][c] = '0';
					if (r - 1 >= 0 && grid[r - 1][c] == '1') {
						uf.union(r * nc + c, (r - 1) * nc + c);
					}
					if (r + 1 < nr && grid[r + 1][c] == '1') {
						uf.union(r * nc + c, (r + 1) * nc + c);
					}
					if (c - 1 >= 0 && grid[r][c - 1] == '1') {
						uf.union(r * nc + c, r * nc + c - 1);
					}
					if (c + 1 < nc && grid[r][c + 1] == '1') {
						uf.union(r * nc + c, r * nc + c + 1);
					}
				}
			}
		}

		return uf.getCount();
	}
}