Interesting article. I remember have solved a leetcode problem called "Trapping Rain Water" https://leetcode.com/problems/trapping-rain-water/descriptio... On leetcode the "elegant" and fastest solution was something like this: class Solution { public: int trap(vector & height) { int i = 1; int n = height.size(); int j = n - 1; int leftmax = height[0]; int rightmax = height[n - 1]; int tw = 0; while (i height[i]) { t…
My slow solution:
class Solution:
def trap(self, height: List[int]) -> int:
l,r,s = [*accumulate(height,max),[*accumulate(height[::-1],max)],len(height)
return sum(max(0, min(l[i], r[s-i-1])-height[i]) for i in range(s))