摘要：
Problem Description:http://oj.leetcode.com/problems/trapping-rain-water/Basic idea: Get the index of max number of the array, then split the array at that point. Find the left max num, calcaute the water trapped between left max num and the max num. Go left recursively until meeting the start of the 阅读全文