给你一个 m x n 的矩阵，其中的值均为非负整数，代表二维高度图每个单元的高度，请计算图中形状最多能接多少体积的雨水。

class Solution {

    class Cell{

        private int row;

        private int col;

        private int height;

        

        public Cell(int row,int col,int height) {

            this.row=row;

            this.col=col;

            this.height=height;

        }

    }

    public int trapRainWater(int[][] heightMap) {

        if(heightMap==null || heightMap.length<=2 || heightMap.length<=2)

            return 0;

        PriorityQueue<Cell> queue=new PriorityQueue<>(Comparator.comparingInt((Cell cell)->cell.height));

        int m=heightMap.length;

        int n=heightMap[0].length;

        boolean[][] visited=new boolean[m][n];

        for(int i=0;i<m;i++) {

            visited[i][0]=visited[i][n-1]=true;

            queue.add(new Cell(i,0,heightMap[i][0]));

            queue.add(new Cell(i,n-1,heightMap[i][n-1]));

        }

        for(int i=1;i<n-1;i++) {

            visited[0][i]=visited[m-1][i]=true;

            queue.add(new Cell(0,i,heightMap[0][i]));

            queue.add(new Cell(m-1,i,heightMap[m-1][i]));

        }

        int ans=0;

        int[][] bounds= {{-1,0},{1,0},{0,-1},{0,1}};

        while(!queue.isEmpty()) {

            Cell now=queue.poll();

            for(int[] bound : bounds) {

                int row=now.row+bound[0];

                int col=now.col+bound[1];

                if(row>=0 && row<m && col>=0 && col<n && !visited[row][col]) {

                    ans+=Math.max(0, now.height-heightMap[row][col]);

                    visited[row][col]=true;

                    queue.add(new Cell(row,col,Math.max(heightMap[row][col],now.height)));

                }

            }

        }

        return ans;

    }

}