解题思路:
本质就是统计排序后对应位置不同的个数,代码如下:
class Solution {
public:
int heightChecker(vector<int>& heights) {
vector<int> sortHeight = heights;
sort(sortHeight.begin(), sortHeight.end());
int count = 0;
for(int i = 0; i < heights.size(); i ++) {
if(sortHeight[i] != heights[i]) {
count ++;
}
}
return count;
}
};