python写算法题：leetcode: 84. Largest Rectangle in Histogram

最新推荐文章于 2022-03-04 20:23:19 发布

激荡数十年

最新推荐文章于 2022-03-04 20:23:19 发布

阅读量193

点赞数

分类专栏：算法 python

本文链接：https://blog.csdn.net/lzf_china/article/details/94749044

版权

算法同时被 2 个专栏收录

158 篇文章 0 订阅

订阅专栏

python

115 篇文章 0 订阅

订阅专栏

class Solution(object):
    def _largestArea(self, sortHeight, ind, heights, left, right):
        if right<=left:
            return 0
        if right-left<=1:
            return heights[left]*(right-left)
        while ind<len(sortHeight) and not left<=sortHeight[ind][0]<right:
            ind+=1
        if ind>=len(sortHeight):
            return 0
        return max((right-left)*sortHeight[ind][1],
                   self._largestArea(sortHeight, ind+1, heights, left, sortHeight[ind][0]),
                   self._largestArea(sortHeight, ind+1, heights, sortHeight[ind][0]+1, right)
                   )
    def largestRectangleArea(self, heights):
        """
        :type heights: List[int]
        :rtype: int
        """
        sortHeights = sorted([v for v in enumerate(heights)], key=lambda x:x[1])
        return self._largestArea(sortHeights, 0, heights, 0, len(sortHeights))