smallest-missing-integer-greater-than-sequential-prefix-sum

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 a 0-indexed array of integers <code>nums</code>.

A prefix <code>nums[0..i]</code> is sequential if, for all <code>1 &lt;= j &lt;= i</code>, <code>nums[j] = nums[j - 1] + 1</code>. In particular, the prefix consisting only of <code>nums[0]</code> is sequential.

Return the smallest integer <code>x</code> missing from <code>nums</code> such that <code>x</code> is greater than or equal to the sum of the longest sequential prefix.

&nbsp;
Example 1:

<pre>
Input: nums = [1,2,3,2,5]
Output: 6
Explanation: The longest sequential prefix of nums is [1,2,3] with a sum of 6. 6 is not in the array, therefore 6 is the smallest missing integer greater than or equal to the sum of the longest sequential prefix.
</pre>

Example 2:

<pre>
Input: nums = [3,4,5,1,12,14,13]
Output: 15
Explanation: The longest sequential prefix of nums is [3,4,5] with a sum of 12. 12, 13, and 14 belong to the array while 15 does not. Therefore 15 is the smallest missing integer greater than or equal to the sum of the longest sequential prefix.
</pre>

&nbsp;
Constraints:

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

missingInteger

Smallest Missing Integer Greater Than Sequential Prefix Sum

Longest Common Prefix

longest-common-prefix

最长公共前缀

First Missing Positive

first-missing-positive

缺失的第一个正数

Next Greater Element I

next-greater-element-i

下一个更大元素 I

Array

Hash Table

Sorting

给你一个下标从 0&nbsp;开始的整数数组&nbsp;<code>nums</code>&nbsp;。

如果一个前缀&nbsp;<code>nums[0..i]</code>&nbsp;满足对于&nbsp;<code>1 &lt;= j &lt;= i</code>&nbsp;的所有元素都有&nbsp;<code>nums[j] = nums[j - 1] + 1</code>&nbsp;，那么我们称这个前缀是一个 顺序前缀 。特殊情况是，只包含&nbsp;<code>nums[0]</code>&nbsp;的前缀也是一个 顺序前缀 。

请你返回 <code>nums</code>&nbsp;中没有出现过的 最小&nbsp;整数&nbsp;<code>x</code>&nbsp;，满足&nbsp;<code>x</code>&nbsp;大于等于&nbsp;最长 顺序前缀的和。

&nbsp;

示例 1：

<pre>
输入：nums = [1,2,3,2,5]
输出：6
解释：nums 的最长顺序前缀是 [1,2,3] ，和为 6 ，6 不在数组中，所以 6 是大于等于最长顺序前缀和的最小整数。
</pre>

示例 2：

<pre>
输入：nums = [3,4,5,1,12,14,13]
输出：15
解释：nums 的最长顺序前缀是 [3,4,5] ，和为 12 ，12、13 和 14 都在数组中，但 15 不在，所以 15 是大于等于最长顺序前缀和的最小整数。
</pre>

&nbsp;

提示：

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