Create maximum-score-of-a-good-subarray.py

Author: kamyu104

Python/maximum-score-of-a-good-subarray.py

@@ -0,0 +1,15 @@
+# Time:  O(n)
+# Space: O(n)
+
+class Solution(object):
+    def largestRectangleArea(self, heights):
+        """
+        :type heights: List[int]
+        :rtype: int
+        """
+        stk, result, i = [-1], 0, 0
+        for i in xrange(len(heights)+1):
+            while stk[-1] != -1 and (i == len(heights) or heights[stk[-1]] >= heights[i]):
+                result = max(result, heights[stk.pop()]*((i-1)-stk[-1]))
+            stk.append(i) 
+        return result