42-Trapping-Rain-Water.java

class Solution {
    public int trap(int[] heights) {
        int left[]=new int[heights.length],right[]=new int[heights.length],max=heights[0],c=0;
        
        for(int i=0;i<heights.length;i++){
            left[i]=Math.max(heights[i],max);
            max=left[i];
        }
        
        max=heights[heights.length-1];
         for(int i=heights.length-1;i>=0;i--){
            right[i]=Math.max(heights[i],max);
            max=right[i];
        }
        System.out.println(Arrays.toString(right));
       for(int i=0;i<heights.length;i++){
           c=c+Math.min(left[i],right[i]) -heights[i];
       }
            return c;
    }
    
}