Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (15)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (10)
  • Network (66)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (3)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [LeetCode 84] Largest Rectangle in Histogram

    Published Feb 13, 2022 [  Stack  ]

    Problem

    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 <= 105
    0 <= heights[i] <= 104
    

    TypeScript

    function largestRectangleArea(heights: number[]): number {
        let maxArea: number = 0;
        // stores [startIndex, height] of a histogram
        let stack: number[][] = [];
        
        for(let i = 0; i < heights.length; i++){
            const height: number = heights[i];
            // let's assume the startIndex is the same as current index first
            let startIndex: number = i;
            
            // while current height is less than the top height in stack
            while(stack.length !== 0 && stack[stack.length - 1][1] > height){
                const top: number[] = stack.pop()
                const topIndex: number = top[0]
                const topHeight: number = top[1]
                // calculate the furthest left we can get
                maxArea = Math.max(maxArea, (i - topIndex) * topHeight)
                startIndex = topIndex
            }
            stack.push([startIndex, height])
        }
        
        // we still have increasing elements which can extend to the end in stack
        for(let data of stack){
            maxArea = Math.max(maxArea, (heights.length - data[0]) * data[1])
        }
        
        return maxArea
    };
    

    Reference