-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
912.java
48 lines (45 loc) · 1.55 KB
/
912.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
__________________________________________________________________________________________________
sample 2 ms submission
class Solution {
public int[] sortArray(int[] nums) {
int[] res = new int[nums.length];
int max = Integer.MIN_VALUE;
int min = Integer.MAX_VALUE;
if (nums.length % 2 != 0) {
max = nums[0];
min = nums[0];
}
for (int i = nums.length % 2 == 0 ? 0 : 1; i < nums.length; i += 2) {
int localMax = nums[i];
int localMin = nums[i];
if (nums[i + 1] > nums[i]) {
localMax = nums[i + 1];
} else {
localMin = nums[i + 1];
}
max = Math.max(max, localMax);
min = Math.min(min, localMin);
}
int[] count = new int[max - min + 1];
for (int i : nums) {
count[i - min]++;
}
for (int i = 1; i < count.length; i++) {
count[i] += count[i - 1];
}
for (int i : nums) {
res[--count[i - min]] = i;
}
return res;
}
}
__________________________________________________________________________________________________
sample 42756 kb submission
class Solution {
public int[] sortArray(int[] nums) {
List<Integer> list = Arrays.stream(nums).boxed().collect(Collectors.toList());
Collections.sort(list);
return list.stream().mapToInt(i -> (Integer)i).toArray();
}
}
__________________________________________________________________________________________________