#未通过:先找到i的位置
class Solution:
def maximumSumOfHeights(self, maxHeights: List[int]) -> int:
n = len(maxHeights)
heights = [0] * n
i = maxHeights.index(max(maxHeights))
heights[i] = maxHeights[i]
l,r = i-1,i+1
while l >= 0 or r <= n-1:
print(heights)
if l < 0:
heights[r] = min(maxHeights[r],heights[r-1])
r += 1
continue
if r > n-1:
heights[l] = min(maxHeights[l],heights[l+1])
l -= 1
continue
heights[l] = min(maxHeights[l],heights[l+1])
l -= 1
heights[r] = min(maxHeights[r],heights[r-1])
r += 1
return sum(heights)
2865. 美丽塔 I
最新推荐文章于 2024-07-25 12:55:52 发布