leetcode出现bug了？

class Solution {
    public double trapRainWater(int[][] heightMap) {
        int heightMap_copy[][] = new int[heightMap.length+2][heightMap[0].length+2];
        int heightMap_copy2[][] = new int[heightMap.length+2][heightMap[0].length+2];

        for (int j = 1; j < heightMap_copy[0].length-1; j++) {
            for (int i = 1; i < heightMap_copy.length-1; i++) {
                heightMap_copy[i][j] = heightMap[i-1][j-1];
                heightMap_copy2[i][j] = heightMap[i-1][j-1];
            }
        }

        System.out.println();

        int length = heightMap_copy.length;
        int width = heightMap_copy[0].length;

        if (length == 2 || width == 2) {
            return 0;
        }

        // 添加递归调用的边界条件
        if (length == 0 || width == 0) {
            return 0;
        }

        int ret = new Solution().trapRainWater(heightMap_copy2);

        return ret;
    }
}