題目如下：

Students are asked to stand in non-decreasing order of heights for an annual photo.

Return the minimum number of students not standing in the right positions.? (This is the number of students that must move in order for all students to be standing in non-decreasing order of height.)

?

Example 1:

Input: [1,1,4,2,1,3] Output: 3 Explanation: Students with heights 4, 3 and the last 1 are not standing in the right positions.

?

Note:

1 <= heights.length <= 100

1 <= heights[i] <= 100

解題思路：本題要求的是有多少人沒有站在正確的位置上，那么只要和正確的站位比較，看看有多少值對應不上即可。

代碼如下：

class Solution(object):def heightChecker(self, heights):""":type heights: List[int]:rtype: int"""sorted_heights = sorted(heights)res = 0for v1,v2 in zip(heights,sorted_heights):res += 1 if v1 != v2 else 0return res

?

轉載于:https://www.cnblogs.com/seyjs/p/10930557.html

總結

以上是生活随笔為你收集整理的【leetcode】1051. Height Checker的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。