minimum-number-of-operations-to-make-array-continuous

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 integer array <code>nums</code>. In one operation, you can replace any element in <code>nums</code> with any integer.

<code>nums</code> is considered continuous if both of the following conditions are fulfilled:

<ul>
	<li>All elements in <code>nums</code> are unique.</li>
	<li>The difference between the maximum element and the minimum element in <code>nums</code> equals <code>nums.length - 1</code>.</li>
</ul>

For example, <code>nums = [4, 2, 5, 3]</code> is continuous, but <code>nums = [1, 2, 3, 5, 6]</code> is not continuous.

Return the minimum number of operations to make <code>nums</code> continuous.

&nbsp;
Example 1:

<pre>
Input: nums = [4,2,5,3]
Output: 0
Explanation:&nbsp;nums is already continuous.
</pre>

Example 2:

<pre>
Input: nums = [1,2,3,5,6]
Output: 1
Explanation:&nbsp;One possible solution is to change the last element to 4.
The resulting array is [1,2,3,5,4], which is continuous.
</pre>

Example 3:

<pre>
Input: nums = [1,10,100,1000]
Output: 3
Explanation:&nbsp;One possible solution is to:
- Change the second element to 2.
- Change the third element to 3.
- Change the fourth element to 4.
The resulting array is [1,2,3,4], which is continuous.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
</ul>

minOperations

Minimum Number of Operations to Make Array Continuous

Longest Repeating Character Replacement

longest-repeating-character-replacement

替换后的最长重复字符

Continuous Subarray Sum

continuous-subarray-sum

连续的子数组和

Moving Stones Until Consecutive II

moving-stones-until-consecutive-ii

移动石子直到连续 II

Minimum One Bit Operations to Make Integers Zero

minimum-one-bit-operations-to-make-integers-zero

使整数变为 0 的最少操作次数

Minimum Adjacent Swaps for K Consecutive Ones

minimum-adjacent-swaps-for-k-consecutive-ones

得到连续 K 个 1 的最少相邻交换次数

Array

Hash Table

Binary Search

Sliding Window

给你一个整数数组&nbsp;<code>nums</code>&nbsp;。每一次操作中，你可以将&nbsp;<code>nums</code>&nbsp;中&nbsp;任意&nbsp;一个元素替换成 任意&nbsp;整数。

如果&nbsp;<code>nums</code>&nbsp;满足以下条件，那么它是 连续的&nbsp;：

<ul>
	<li><code>nums</code>&nbsp;中所有元素都是 互不相同&nbsp;的。</li>
	<li><code>nums</code>&nbsp;中 最大&nbsp;元素与&nbsp;最小&nbsp;元素的差等于&nbsp;<code>nums.length - 1</code>&nbsp;。</li>
</ul>

比方说，<code>nums = [4, 2, 5, 3]</code>&nbsp;是 连续的&nbsp;，但是&nbsp;<code>nums = [1, 2, 3, 5, 6]</code> 不是连续的&nbsp;。

请你返回使 <code>nums</code>&nbsp;连续&nbsp;的 最少&nbsp;操作次数。

&nbsp;

示例 1：

<pre>输入：nums = [4,2,5,3]
输出：0
解释：nums 已经是连续的了。
</pre>

示例 2：

<pre>输入：nums = [1,2,3,5,6]
输出：1
解释：一个可能的解是将最后一个元素变为 4 。
结果数组为 [1,2,3,5,4] ，是连续数组。
</pre>

示例 3：

<pre>输入：nums = [1,10,100,1000]
输出：3
解释：一个可能的解是：
- 将第二个元素变为 2 。
- 将第三个元素变为 3 。
- 将第四个元素变为 4 。
结果数组为 [1,2,3,4] ，是连续数组。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
</ul>