努橙刷题编

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

https://leetcode.com/problems/largest-rectangle-in-histogram/

public class Solution {
    public int largestRectangleArea(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();
                int height = heights[tmp];
                int width = stack.isEmpty() ? i : i - stack.peek() - 1;
                result = Math.max(result, height * width);
            }
            stack.push(i);
        }
        
        // process the numbers left in stack
        while (!stack.isEmpty() && heights[stack.peek()] >= 0) {
            int tmp = stack.pop();
            int height = heights[tmp];
            int width = stack.isEmpty() ? heights.length : heights.length - stack.peek() - 1;
            result = Math.max(result, height * width);
        }
        return result;
    }
}

 

posted on 2017-05-31 15:19  努橙  阅读(126)  评论(0编辑  收藏  举报