2017年3月20日
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. 阅读全文
posted @ 2017-03-20 20:03 Deribs4 阅读(126) 评论(0) 推荐(0)
Leetcode 11. Container With Most Water
摘要： Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo 阅读全文
posted @ 2017-03-20 15:48 Deribs4 阅读(158) 评论(0) 推荐(0)