-
Notifications
You must be signed in to change notification settings - Fork 5
/
_1051_Height_Checker.java
65 lines (51 loc) · 1.97 KB
/
_1051_Height_Checker.java
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
package com.github.junyu.solution.leetCode.easy.array;
import java.util.Arrays;
public class _1051_Height_Checker {
/* Students are asked to stand in non-decreasing order of heights for an annual photo.
Return the minimum number of students that must move in order for all students to be standing
in non-decreasing order of height.
Notice that when a group of students is selected they can reorder in any possible way between
themselves and the non selected students remain on their seats.
Example 1:
Input: heights = [1,1,4,2,1,3]
Output: 3
Explanation:
Current array : [1,1,4,2,1,3]
Target array : [1,1,1,2,3,4]
On index 2 (0-based) we have 4 vs 1 so we have to move this student.
On index 4 (0-based) we have 1 vs 3 so we have to move this student.
On index 5 (0-based) we have 3 vs 4 so we have to move this student.
Example 2:
Input: heights = [5,1,2,3,4]
Output: 5
Example 3:
Input: heights = [1,2,3,4,5]
Output: 0
Constraints:
1 <= heights.length <= 100
1 <= heights[i] <= 100
*/
/**
* 将数组按升序排序以后,位置发生变化的元素的数量
* 思路:复制一份数组并进行升序排序,然后比较每个位置不同元素的数量
* @param heights
* @return
*/
public int heightChecker(int[] heights) {
int count = 0;
int[] arr = Arrays.copyOf(heights, heights.length);
Arrays.sort(arr);
for (int i = 0; i < heights.length; i++) {
if (arr[i] != heights[i]) {
count++;
}
}
return count;
}
public static void main(String[] args) {
_1051_Height_Checker test = new _1051_Height_Checker();
System.out.println(test.heightChecker(new int[]{1, 1, 4, 2, 1, 3}));
System.out.println(test.heightChecker(new int[]{5, 1, 2, 3, 4}));
System.out.println(test.heightChecker(new int[]{1, 2, 3, 4, 5}));
}
}