Leetcode 42. Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

For example, 
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.

The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!

public class Solution {
    public int trap(int[] height) {
      int length = height.length;

      int maxL = new int[length];
      int maxR = new int[length];

      if(n <= 2)
        return 0;

      int max = 0;
      for(int i = 1; i < n - 1; i ++){
        maxL[i] = max;
        if(max < height[i])
          max = A[i];
      }
      max = A[n - 1]
      maxR[n - 1] = 0;
      int ctrap,ttrap = 0;
      for(int i = n-2; i > 0; i--){
        maxR[i] = max;
        ctra[]
      }
    }
}