forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
32 lines (32 loc) · 900 Bytes
/
Solution.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
class Solution {
public long makeSimilar(int[] nums, int[] target) {
Arrays.sort(nums);
Arrays.sort(target);
List<Integer> a1 = new ArrayList<>();
List<Integer> a2 = new ArrayList<>();
List<Integer> b1 = new ArrayList<>();
List<Integer> b2 = new ArrayList<>();
for (int v : nums) {
if (v % 2 == 0) {
a1.add(v);
} else {
a2.add(v);
}
}
for (int v : target) {
if (v % 2 == 0) {
b1.add(v);
} else {
b2.add(v);
}
}
long ans = 0;
for (int i = 0; i < a1.size(); ++i) {
ans += Math.abs(a1.get(i) - b1.get(i));
}
for (int i = 0; i < a2.size(); ++i) {
ans += Math.abs(a2.get(i) - b2.get(i));
}
return ans / 4;
}
}