[LeetCode] 1051. Height Checker 身高检查器
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
这道题说是有一群学生随机的站成一排照相,现在想让学生按照身高来排列,问需要移动
多个同学。这是一道很简单的题目没有什么难度,只要复制一个新的数组,然后给数组排序,再跟原数组逐个按数字来对比,只要数字不同,则结果 res 自增1即可,参见代码如下:
class Solution {
public:
int heightChecker(vector<int>& heights) {
int res = 0, n = heights.size();
vector<int> sorted = heights;
sort(sorted.begin(), sorted.end());
for (int i = 0; i < n; ++i) {
if (sorted[i] != heights[i]) ++res;
}
return res;
}
};
Github 同步地址:
https://github.com/grandyang/leetcode/issues/1051
参考资料:
https://leetcode.com/problems/height-checker/
https://leetcode.com/problems/height-checker/discuss/299221/C%2B%2B-Sort
https://leetcode.com/problems/height-checker/discuss/299216/Java-Sort-1ms-O(nlogn)
相关文章
- Leetcode: House Robber III
- LeetCode高频题:n杯溶液按照顺序排成一排,可以混合相邻2杯,合并代价/时间是两杯质量和,经过n-1次合并为1杯,最小时间/代价是多少
- JS leetcode 猜数字 题解分析,我以为题目在第八层我在第一层,其实我在第三层题目在第一层
- 每日leetcode算法题:2042检查句子中的数字是否递增
- 【算法/回溯算法】leetcode刷题路线(持续更新)
- [LeetCode] 1224. Maximum Equal Frequency 最大相等频率
- [LeetCode] 1003. Check If Word Is Valid After Substitutions 检查替换后的词是否有效
- [LeetCode] 958. Check Completeness of a Binary Tree 检查二叉树的完全性
- [LeetCode] 911. Online Election 在线选举
- [LeetCode] Short Encoding of Words 单词集的短编码
- [LeetCode] 778. Swim in Rising Water 在上升的水中游泳
- [LeetCode] Max Increase to Keep City Skyline 保持城市天际线的最大增高
- [LeetCode] 24. Swap Nodes in Pairs 成对交换节点
- [LeetCode] 78. Subsets 子集合
- leetcode算法231.2 的幂
- leetcode算法168.Excel表列名称