mirror of
https://github.com/prdlk/leetcode.git
synced 2026-11-02 13:12:44 +00:00
feat(work): add new LeetCode solutions for median, largest rectangle, and simplify path
This commit is contained in:
1 parent
f14dcf2723
commit
d388b3000e
3 files changed
+203
No files matched your search
@@ -0,0 +1,38 @@
|
||||
"""
|
||||
84. Largest Rectangle in Histogram
|
||||
Difficulty: Hard
|
||||
https://leetcode.com/problems/largest-rectangle-in-histogram/
|
||||
|
||||
──────────────────────────────────────────────────
|
||||
|
||||
Given an array of integers heights representing the histogram's bar
|
||||
height where the width of each bar is 1, return the area of the
|
||||
largest rectangle in the histogram.
|
||||
|
||||
|
||||
|
||||
Example 1:
|
||||
|
||||
Input: heights = [2,1,5,6,2,3]
|
||||
Output: 10
|
||||
Explanation: The above is a histogram where width of each bar is 1.
|
||||
The largest rectangle is shown in the red area, which has an area =
|
||||
10 units.
|
||||
|
||||
Example 2:
|
||||
|
||||
Input: heights = [2,4]
|
||||
Output: 4
|
||||
|
||||
|
||||
|
||||
Constraints:
|
||||
|
||||
• 1 <= heights.length <= 10^5
|
||||
|
||||
• 0 <= heights[i] <= 10^4
|
||||
"""
|
||||
|
||||
class Solution:
|
||||
def largestRectangleArea(self, heights: list[int]) -> int:
|
||||
|
||||
Reference in new issue
Block a user