LargestRectangleinHistogram.cs

// Source : https://leetcode.com/problems/largest-rectangle-in-histogram/ 
// Author : codeyu 
// Date : Friday, February 17, 2017 9:08:25 PM 

/**********************************************************************************
*
* 
* Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
* 
* 
* 
* 
* Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3].
* 
* 
* 
* 
* The largest rectangle is shown in the shaded area, which has area = 10 unit.
* 
* 
* 
* For example,
* Given heights = [2,1,5,6,2,3],
* return 10.
* 
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution084 {
    public static int LargestRectangleArea(int[] heights) {
throw new NotImplementedException("TODO");
        
    }
}}