-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathHeight Checker.cpp
33 lines (22 loc) · 973 Bytes
/
Height Checker.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/*
Solution by Rahul Surana
***********************************************************
A school is trying to take an annual photo of all the students.
The students are asked to stand in a single file line in non-decreasing order by height.
Let this ordering be represented by the integer array expected
where expected[i] is the expected height of the ith student in line.
You are given an integer array heights representing the current order that the students are standing in.
Each heights[i] is the height of the ith student in line (0-indexed).
Return the number of indices where heights[i] != expected[i].
***********************************************************
*/
class Solution {
public:
int heightChecker(vector<int>& heights) {
vector<int> idx = heights;
int ans = 0;
sort(idx.begin(),idx.end());
for(int i = 0; i < idx.size(); i++) if(idx[i] != heights[i]) ans++;
return ans;
}
};