Height Checker LeetCode solution in C++

1
class Solution {
2
public:
3
int heightChecker(vector<int> &heights) {
4
vector<int> expected = heights;
5
int count = 0;
6
sort(expected.begin(), expected.end());
7
for (int i = 0; i < heights.size(); i++) {
8
if (heights[i] != expected[i]) count++;
9
}
10
return count;
11
}
12
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0