minimum-consecutive-cards-to-pick-up

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>cards</code> where <code>cards[i]</code> represents the value of the <code>ith</code> card. A pair of cards are matching if the cards have the same value.

Return the minimum number of consecutive cards you have to pick up to have a pair of matching cards among the picked cards. If it is impossible to have matching cards, return <code>-1</code>.

&nbsp;
Example 1:

<pre>
Input: cards = [3,4,2,3,4,7]
Output: 4
Explanation: We can pick up the cards [3,4,2,3] which contain a matching pair of cards with value 3. Note that picking up the cards [4,2,3,4] is also optimal.
</pre>

Example 2:

<pre>
Input: cards = [1,0,5,3]
Output: -1
Explanation: There is no way to pick up a set of consecutive cards that contain a pair of matching cards.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= cards.length &lt;= 105</code></li>
	<li><code>0 &lt;= cards[i] &lt;= 106</code></li>
</ul>

minimumCardPickup

Minimum Consecutive Cards to Pick Up

Longest Substring Without Repeating Characters

longest-substring-without-repeating-characters

无重复字符的最长子串

Array

Hash Table

Sliding Window

给你一个整数数组 <code>cards</code> ，其中 <code>cards[i]</code> 表示第 <code>i</code> 张卡牌的 值 。如果两张卡牌的值相同，则认为这一对卡牌 匹配 。

返回你必须拿起的最小连续卡牌数，以使在拿起的卡牌中有一对匹配的卡牌。如果无法得到一对匹配的卡牌，返回 <code>-1</code> 。

&nbsp;

示例 1：

<pre>输入：cards = [3,4,2,3,4,7]
输出：4
解释：拿起卡牌 [3,4,2,3] 将会包含一对值为 3 的匹配卡牌。注意，拿起 [4,2,3,4] 也是最优方案。</pre>

示例 2：

<pre>输入：cards = [1,0,5,3]
输出：-1
解释：无法找出含一对匹配卡牌的一组连续卡牌。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= cards.length &lt;= 105</code></li>
	<li><code>0 &lt;= cards[i] &lt;= 106</code></li>
</ul>