[LeetCode] 42. Trapping Rain Water
Posted 努橙刷题编
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] 42. Trapping Rain Water相关的知识,希望对你有一定的参考价值。
https://leetcode.com/problems/trapping-rain-water/
思路一:参考 84. Largest Rectangle in Histogram,用 stack 做辅助
public class Solution { public int trap(int[] heights) { int result = 0; Stack<Integer> stack = new Stack<>(); for (int i = 0; i < heights.length; i++) { while (!stack.isEmpty() && heights[stack.peek()] < heights[i]) { int tmp = stack.pop(); // index of bottom int height = stack.isEmpty() ? 0 : Math.min(heights[stack.peek()], heights[i]) - heights[tmp]; int width = stack.isEmpty() ? 0 : i - stack.peek() - 1; result += height * width; } stack.push(i); } return result; } }
思路二:dynamic programming
以上是关于[LeetCode] 42. Trapping Rain Water的主要内容,如果未能解决你的问题,请参考以下文章
leetcode42 Trapping Rain Water
LeetCode-42-Trapping Rain Water
leetcode 42. Trapping Rain Water
LeetCode 42. Trapping Rain Water