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
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: 5Example 3:
Input: heights = [1,2,3,4,5]
Output: 0
/**
* @param {number[]} heights
* @return {number}
*/
var heightChecker = function(heights) {
let movedStudents = 0;
const heightsOrigin = [...heights];
heights.sort((a, b) => {
if(a > b) {
return 1;
}
if(a < b) {
return -1;
}
return 0;
});
for(let i = 0; i < heights.length; i++) {
if(heightsOrigin[i] != heights[i]) {
movedStudents++;
}
}
return movedStudents;
};