mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
48 lines
1.7 KiB
HTML
48 lines
1.7 KiB
HTML
<p>A school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in <strong>non-decreasing order</strong> by height. Let this ordering be represented by the integer array <code>expected</code> where <code>expected[i]</code> is the expected height of the <code>i<sup>th</sup></code> student in line.</p>
|
|
|
|
<p>You are given an integer array <code>heights</code> representing the <strong>current order</strong> that the students are standing in. Each <code>heights[i]</code> is the height of the <code>i<sup>th</sup></code> student in line (<strong>0-indexed</strong>).</p>
|
|
|
|
<p>Return <em>the <strong>number of indices</strong> where </em><code>heights[i] != expected[i]</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> heights = [1,1,4,2,1,3]
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong>
|
|
heights: [1,1,<u>4</u>,2,<u>1</u>,<u>3</u>]
|
|
expected: [1,1,<u>1</u>,2,<u>3</u>,<u>4</u>]
|
|
Indices 2, 4, and 5 do not match.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> heights = [5,1,2,3,4]
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong>
|
|
heights: [<u>5</u>,<u>1</u>,<u>2</u>,<u>3</u>,<u>4</u>]
|
|
expected: [<u>1</u>,<u>2</u>,<u>3</u>,<u>4</u>,<u>5</u>]
|
|
All indices do not match.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> heights = [1,2,3,4,5]
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong>
|
|
heights: [1,2,3,4,5]
|
|
expected: [1,2,3,4,5]
|
|
All indices match.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= heights.length <= 100</code></li>
|
|
<li><code>1 <= heights[i] <= 100</code></li>
|
|
</ul>
|