方法一:
理解题意:
class Solution {
public:
int heightChecker(vector<int>& heights) {
int n=heights.size();
int cnt=0;
vector<int> vec(heights);//vector复制初始化
sort(heights.begin(),heights.end());
for(int i=0;i<n;i++){
if(heights[i]!=vec[i]){
cnt++;
}
}
return cnt;
}
};