LeetCode --- 1051. Height Checker 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1051. Height Checker 解题报告相关的知识,希望对你有一定的参考价值。

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 non-decreasing order by height. Let this ordering be represented by the integer array expected where expected[i] is the expected height of the ith student in line.

You are given an integer array heights representing the current order that the students are standing in. Each heights[i] is the height of the ith student in line (0-indexed).

Return the number of indices where heights[i] != expected[i].

Example 1:

Input: heights = [1,1,4,2,1,3]
Output: 3
Explanation: 
heights:  [1,1,4,2,1,3]
expected: [1,1,1,2,3,4]
Indices 2, 4, and 5 do not match

以上是关于LeetCode --- 1051. Height Checker 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode --- 1051. Height Checker 解题报告

Leetcode1051Height Checker

算法leetcode1051. 高度检查器(rust和go)

算法leetcode1051. 高度检查器(rust和go)

LEETCODE401051. Height Checker

1051. Height Checker