AlanRedsheep

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. For example, Given [0,1...

42 Trapping Rain Water 关键词 Arrays & Two Pointers & Stack 原题 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 t...

755 Pour Water 关键词 Arrays 原题 We are given an elevation map, heights[i] representing the height of the terrain at that index. The width at each index is 1. After V units of water fall at index K, how m...