-
Notifications
You must be signed in to change notification settings - Fork 0
/
heightChecker.js
72 lines (51 loc) · 1.7 KB
/
heightChecker.js
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// LeetCode #1051. Height Checker
/* Instructions
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].
Example 1:
Input: heights = [1,1,4,2,1,3]
Output: 3
Explanation:
heights: [1,1,4,2,1,3]
expected: [1,1,1,2,3,4]
Indices 2, 4, and 5 do not match.
Example 2:
Input: heights = [5,1,2,3,4]
Output: 5
Explanation:
heights: [5,1,2,3,4]
expected: [1,2,3,4,5]
All indices do not match.
Example 3:
Input: heights = [1,2,3,4,5]
Output: 0
Explanation:
heights: [1,2,3,4,5]
expected: [1,2,3,4,5]
All indices match.
Constraints:
1 <= heights.length <= 100
1 <= heights[i] <= 100
*/
// Solution
const heightChecker = (heights) => {
let count = 0
let expected = []
for (let i = 0; i < heights.length; i++) {
expected.push( heights[i] )
}
expected.sort((a, b) => a - b)
for (let i = 0; i < expected.length; i++) {
if ( expected[i] !== heights[i] ){
count++
}
}
return count
}
// Explanation
// Instantiate a variable to hold the count of unmatching indices
// Loop through each element in the array and push each value into a new array
// Then, sort the heights array
// Then, check if each index in the two arrays are equal, and if not, add 1 to the count
// Return the count