Update find-sorted-submatrices-with-maximum-element-at-most-k.py

kamyu104 · web-flow · commit 4c6f2d852b4a · 2024-11-25T20:30:03.000+08:00
diff --git a/Python/find-sorted-submatrices-with-maximum-element-at-most-k.py b/Python/find-sorted-submatrices-with-maximum-element-at-most-k.py
@@ -13,7 +13,7 @@ def count(heights):
             result = curr = 0
             stk = []
             for i in xrange(len(heights)):
-                while stk and heights[stk[-1]] > heights[i]:
+                while stk and heights[stk[-1]] >= heights[i]:
                     j = stk.pop()
                     curr -= (heights[j]-heights[i])*(j-(stk[-1] if stk else -1))
                 stk.append(i)
