mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
45 lines
2.1 KiB
HTML
45 lines
2.1 KiB
HTML
<p>You are given an integer array <code>rolls</code> of length <code>n</code> and an integer <code>k</code>. You roll a <code>k</code> sided dice numbered from <code>1</code> to <code>k</code>, <code>n</code> times, where the result of the <code>i<sup>th</sup></code> roll is <code>rolls[i]</code>.</p>
|
|
|
|
<p>Return<em> the length of the <strong>shortest</strong> sequence of rolls so that there's no such <span data-keyword="subsequence-array">subsequence</span> in </em><code>rolls</code>.</p>
|
|
|
|
<p>A <strong>sequence of rolls</strong> of length <code>len</code> is the result of rolling a <code>k</code> sided dice <code>len</code> times.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> rolls = [4,2,1,2,3,3,2,4,1], k = 4
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> Every sequence of rolls of length 1, [1], [2], [3], [4], can be taken from rolls.
|
|
Every sequence of rolls of length 2, [1, 1], [1, 2], ..., [4, 4], can be taken from rolls.
|
|
The sequence [1, 4, 2] cannot be taken from rolls, so we return 3.
|
|
Note that there are other sequences that cannot be taken from rolls.</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> rolls = [1,1,2,2], k = 2
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> Every sequence of rolls of length 1, [1], [2], can be taken from rolls.
|
|
The sequence [2, 1] cannot be taken from rolls, so we return 2.
|
|
Note that there are other sequences that cannot be taken from rolls but [2, 1] is the shortest.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> rolls = [1,1,3,2,2,2,3,3], k = 4
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> The sequence [4] cannot be taken from rolls, so we return 1.
|
|
Note that there are other sequences that cannot be taken from rolls but [4] is the shortest.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == rolls.length</code></li>
|
|
<li><code>1 <= n <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= rolls[i] <= k <= 10<sup>5</sup></code></li>
|
|
</ul>
|