收集雨水問題

題目描述： 題目來源於LeetCode，原意可以形象地理解爲收集雨水問題，如下述 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 exam

>>阅读原文<<