beautiful-towers-i

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array <code>heights</code> of <code>n</code> integers representing the number of bricks in <code>n</code> consecutive towers. Your task is to remove some bricks to form a mountain-shaped tower arrangement. In this arrangement, the tower heights are non-decreasing, reaching a maximum peak value with one or multiple consecutive towers and then non-increasing.

Return the maximum possible sum of heights of a mountain-shaped tower arrangement.

&nbsp;
Example 1:

<div class="example-block">
Input: heights = [5,3,4,1,1]

Output: 13

Explanation:

We remove some bricks to make <code>heights =&nbsp;[5,3,3,1,1]</code>, the peak is at index 0.
</div>

Example 2:

<div class="example-block">
Input: heights = [6,5,3,9,2,7]

Output: 22

Explanation:

We remove some bricks to make <code>heights =&nbsp;[3,3,3,9,2,2]</code>, the peak is at index 3.
</div>

Example 3:

<div class="example-block">
Input: heights = [3,2,5,5,2,3]

Output: 18

Explanation:

We remove some bricks to make <code>heights = [2,2,5,5,2,2]</code>, the peak is at index 2 or 3.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n == heights.length &lt;= 103</code></li>
	<li><code>1 &lt;= heights[i] &lt;= 109</code></li>
</ul>

maximumSumOfHeights

Beautiful Towers I

Valid Mountain Array

valid-mountain-array

有效的山脉数组

Minimum Number of Removals to Make Mountain Array

minimum-number-of-removals-to-make-mountain-array

得到山形数组的最少删除次数

Maximum Number of Books You Can Take

maximum-number-of-books-you-can-take

你能拿走的最大图书数量

Stack

Array

Monotonic Stack

给定一个包含&nbsp;<code>n</code>&nbsp;个整数的数组&nbsp;<code>heights</code>&nbsp;表示&nbsp;<code>n</code>&nbsp;座连续的塔中砖块的数量。你的任务是移除一些砖块来形成一个 山脉状 的塔排列。在这种布置中，塔高度先是非递减，有一个或多个连续塔达到最大峰值，然后非递增排列。

返回满足山脉状塔排列的方案中，高度和的最大值&nbsp;。

&nbsp;

示例 1：

<pre>
输入：maxHeights = [5,3,4,1,1]
输出：13
解释：我们移除一些砖块来形成 heights = [5,3,3,1,1]，峰值位于下标 0。
</pre>

示例 2：

<pre>
输入：maxHeights = [6,5,3,9,2,7]
输出：22
解释：我们移除一些砖块来形成 heights = [3,3,3,9,2,2]，峰值位于下标 3。</pre>

示例 3：

<pre>
输入：maxHeights = [3,2,5,5,2,3]
输出：18
解释：我们移除一些砖块来形成 heights = [2,2,5,5,2,2]，峰值位于下标 2 或 3。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n == heights.length &lt;= 103</code></li>
	<li><code>1 &lt;= heights[i] &lt;= 109</code></li>
</ul>