Height Checker LeetCode solution in Java

1
class Solution {
2
public int heightChecker(int[] heights) {
3

4
int[] dupheights = Arrays.copyOfRange(heights, 0, heights.length);
5

6
Arrays.sort(dupheights);
7
int count = 0;
8

9
for (int i = 0; i < heights.length; i++) {
10

11
if (heights[i] != dupheights[i]) {
12
count++;
13
}
14
}
15

16
return count;
17
}
18
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0