Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Almost like the largest paladromic solution in Clear category for Largest Rectangle in a Histogram by tronner
def largest_histogram(histogram):
def get_all_sublists(l):
length = len(l)
for i in range(length):
for j in range(i,length):
yield l[i:j + 1]
def rect(l):
return min(l)*len(l)
return sorted((rect(l) for l in get_all_sublists(histogram)), reverse=True)[0]
if __name__ == "__main__":
#These "asserts" using only for self-checking and not necessary for auto-testing
assert largest_histogram([5]) == 5, "one is always the biggest"
assert largest_histogram([5, 3]) == 6, "two are smallest X 2"
assert largest_histogram([1, 1, 4, 1]) == 4, "vertical"
assert largest_histogram([1, 1, 3, 1]) == 4, "horizontal"
assert largest_histogram([2, 1, 4, 5, 1, 3, 3]) == 8, "complex"
print("Done! Go check it!")
Oct. 31, 2016
Comments: