LeetCode 42. Trapping Rain Water(java)

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

2018-01-20 07:10:34

阅读数:17

评论数:0

LeetCode 11. Container With Most Water(java)

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

2018-01-15 08:48:20

阅读数:56

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭