def max_water_reservoir(heights): n = len(heights) max_volume = 0 result = None # 用于记录 (i, j, volume) for i in range(n): for j in range(i + 1, n): min_height = min(heights[i], heights[j]) if j - i max_volume: max_volume = volume result = (i, j, volume) elif volume == max_volume and volume > 0: # 如果体积一样，选距离最近的 if (j - i)摘要：def max_water_reservoir(heights): n = len(heights) max_volume = 0 result = None # 用于记录 (i, j, volume) for i in range(n): for j in
来源：天天说教育
