day-08:接雨水

class Solution {
    private static class Cell implements Comparable<Cell> {
		int row;
		int col;
		int height;

		public Cell(int row, int col, int height) {
			this.row = row;
			this.col = col;
			this.height = height;
		}

		@Override
		public int compareTo(Cell o) {
			return this.height - o.height;
		}
	}

	public static int trapRainWater(int[][] heightMap) {
		if (heightMap.length <= 1 || heightMap[0].length <= 1) {
			return 0;
		}
		boolean[][] visited = new boolean[heightMap.length][heightMap[0].length];
		PriorityQueue<Cell> queue = new PriorityQueue<Cell>();
		int waterTraped = 0;
	
		for (int j = 0; j < heightMap[0].length; j++) {
			queue.add(new Cell(0, j, heightMap[0][j]));
			queue.add(new Cell(heightMap.length - 1, j,
					heightMap[heightMap.length - 1][j]));
			visited[0][j] = true;
			visited[heightMap.length - 1][j] = true;
		}
		for (int i = 1; i < heightMap.length - 1; i++) {
														
			queue.add(new Cell(i, 0, heightMap[i][0]));
			queue.add(new Cell(i, heightMap[0].length - 1,
					heightMap[i][heightMap[0].length - 1]));
			visited[i][0] = true;
			visited[i][heightMap[0].length - 1] = true;
		}
		
		Cell lowestWall;
		int row, col;
		int[][] direction = { { 1, 0 }, { 0, 1 }, { -1, 0 }, { 0, -1 } };
		while (!queue.isEmpty()) {
			lowestWall = queue.poll();
			for (int i = 0; i < 4; i++) {
				row = lowestWall.row + direction[i][0];
				col = lowestWall.col + direction[i][1];
				if (row < 0 || row > heightMap.length - 1 || col < 0
						|| col > heightMap[0].length - 1
						|| visited[row][col] == true) {
					continue;
				}
				waterTraped += Math.max(
						lowestWall.height - heightMap[row][col], 0);
				queue.add(new Cell(row, col, Math.max(lowestWall.height,
						heightMap[row][col])));
				visited[row][col] = true;
			}
		}
		return waterTraped;
	}
}