class Solution {
public:
int heightChecker(vector<int>& heights) {
vector<int> temp = heights;
sort(temp.begin(), temp.end());
int res = 0;
for(int i = 0; i < heights.size(); i++)
{
if(temp[i] != heights[i])
{
res++;
}
}
return res;
}
};
leetcode 1051. 高度检查器
最新推荐文章于 2022-06-13 08:46:35 发布