Description
Students are asked to stand in non-decreasing order of heights for an annual photo.
Return the minimum number of students that must move in order for all students to be standing in non-decreasing order of height.
Notice that when a group of students is selected they can reorder in any possible way between themselves and the non selected students remain on their seats.
Example 1:
Input: heights = [1,1,4,2,1,3]
Output: 3
Explanation:
Current array : [1,1,4,2,1,3]
Target array : [1,1,1,2,3,4]
On index 2 (0-based) we have 4 vs 1 so we have to move this student.
On index 4 (0-based) we have 1 vs 3 so we have to move this student.
On index 5 (0-based) we have 3 vs 4 so we have to move this student.
Example 2:
Input: heights = [5,1,2,3,4]
Output: 5
Example 3:
Input: heights = [1,2,3,4,5]
Output: 0
Constraints:
- 1 <= heights.length <= 100.
- 1 <= heights[i] <= 100.
分析
题目的意思是:给你一个数组,只表示学生的身高,问需要移动多少次使得数组非递减排列。我开始想成了一个冒泡排序,但后面发现移动的次数不是那样算的,计算的排序前的位置和排序后的位置不一样的数目,发现这个规律就好办了,一个排序就搞定了哈。
代码
class Solution:
def heightChecker(self, heights: List[int]) -> int:
n=len(heights)
b=[item for item in heights]
b.sort()
cnt=0
for i in range(n):
if(b[i]!=heights[i]):
cnt+=1
return cnt