谷歌面试题（9）

大家都知道谷歌是科技界的领头羊，他的面试题肯定有一些参考意义，所以本人就选了几道代表性面试题。给自己或其他人一些帮助

原题：

// 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.

解析：就是接雨水，数字代表高度，问这个容器能接多少水.
答案：

public class Solution {

    public int trap(int[] height) {

        int water = 0;

        int leftIndex = 0;
        int rightIndex = height.length - 1;

        int leftMax = 0;
        int rightMax = 0;

        while(leftIndex <= rightIndex) {

            leftMax = Math.max(leftMax, height[leftIndex]);
            rightMax = Math.max(rightMax, height[rightIndex]);

            if(leftMax < rightMax) {

                water += leftMax - height[leftIndex];
                leftIndex++;

            }

            else {

                water += rightMax - height[rightIndex];
                rightIndex--;

            }

        }

        return water;

    }

}

解析：能蓄水的话分两种：

1. 左边高，右边低
2. 左边低，右边高