37_leetcode_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.

1:特殊情况，A==NULL, n <= 2；2:遍历数组获得值最大的Index；3:分别从左到右和从右到左遍历到最大的index处，在遍历的过程中，找到当前最大的值的index，并计算可以储存的水的数量，并随时更新当前最大值的索引

 int trap(int A[], int n) {
        
        if( A == NULL || n <= 2)
        {
            return 0;
        }
        
        int maxIndex = 0;
        for(int i = 0; i < n; i++)
        {
            if(A[i] > A[maxIndex])
            {
                maxIndex = i;
            }
        }
        
        int water = 0;
        
        int leftMaxIndex = 0;
        int tempIndex = leftMaxIndex + 1;
        while(tempIndex <= maxIndex - 1)
        {
            if(A[tempIndex] < A[leftMaxIndex])
            {
                water += A[leftMaxIndex] - A[tempIndex];
            }
            else
            {
                leftMaxIndex = tempIndex;
            }
            tempIndex++;
        }
        
        int rightMaxIndex = n - 1;
        tempIndex = rightMaxIndex - 1;
        while(tempIndex >= maxIndex + 1)
        {
            if(A[tempIndex] < A[rightMaxIndex])
            {
                water += A[rightMaxIndex] - A[tempIndex];
            }
            else
            {
                rightMaxIndex = tempIndex;
            }
            tempIndex--;
        }
        
        return water;
    }