maximum-number-of-operations-with-the-same-score-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 of integers <code>nums</code>. Consider the following operation:

<ul>
	<li>Delete the first two elements <code>nums</code> and define the score of the operation as the sum of these two elements.</li>
</ul>

You can perform this operation until <code>nums</code> contains fewer than two elements. Additionally, the same score must be achieved in all operations.

Return the maximum number of operations you can perform.

&nbsp;
Example 1:

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

Output: 2

Explanation:

<ul>
	<li>We can perform the first operation with the score <code>3 + 2 = 5</code>. After this operation, <code>nums = [1,4,5]</code>.</li>
	<li>We can perform the second operation as its score is <code>4 + 1 = 5</code>, the same as the previous operation. After this operation, <code>nums = [5]</code>.</li>
	<li>As there are fewer than two elements, we can&#39;t perform more operations.</li>
</ul>
</div>

Example 2:

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

Output: 2

Explanation:

<ul>
	<li>We can perform the first operation with the score <code>1 + 5 = 6</code>. After this operation, <code>nums = [3,3,4,1,3,2,2,3]</code>.</li>
	<li>We can perform the second operation as its score is <code>3 + 3 = 6</code>, the same as the previous operation. After this operation, <code>nums = [4,1,3,2,2,3]</code>.</li>
	<li>We cannot perform the next operation as its score is <code>4 + 1 = 5</code>, which is different from the previous scores.</li>
</ul>
</div>

Example 3:

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

Output: 1
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
</ul>

maxOperations

Maximum Number of Operations With the Same Score I

Array

Simulation

给你一个整数数组&nbsp;<code>nums</code>&nbsp;，如果&nbsp;<code>nums</code>&nbsp;至少&nbsp;包含&nbsp;<code>2</code>&nbsp;个元素，你可以执行以下操作：

<ul>
	<li>选择 <code>nums</code>&nbsp;中的前两个元素并将它们删除。</li>
</ul>

一次操作的 分数&nbsp;是被删除元素的和。

在确保&nbsp;所有操作分数相同&nbsp;的前提下，请你求出 最多&nbsp;能进行多少次操作。

请你返回按照上述要求 最多&nbsp;可以进行的操作次数。

&nbsp;

示例 1：

<pre>
输入：nums = [3,2,1,4,5]
输出：2
解释：我们执行以下操作：
- 删除前两个元素，分数为 3 + 2 = 5 ，nums = [1,4,5] 。
- 删除前两个元素，分数为 1 + 4 = 5 ，nums = [5] 。
由于只剩下 1 个元素，我们无法继续进行任何操作。</pre>

示例 2：

<pre>
输入：nums = [3,2,6,1,4]
输出：1
解释：我们执行以下操作：
- 删除前两个元素，分数为 3 + 2 = 5 ，nums = [6,1,4] 。
由于下一次操作的分数与前一次不相等，我们无法继续进行任何操作。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= nums.length &lt;= 100</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
</ul>