forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_2094.java
36 lines (34 loc) · 1.27 KB
/
_2094.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
package com.fishercoder.solutions;
import java.util.*;
public class _2094 {
public static class Solution1 {
public int[] findEvenNumbers(int[] digits) {
Set<Integer> set = new HashSet<>();
for (int i = 0; i < digits.length; i++) {
int number = digits[i] * 100;
if (digits[i] != 0) {
for (int j = 0; j < digits.length; j++) {
if (j != i) {
number += digits[j] * 10;
for (int k = 0; k < digits.length; k++) {
if (k != i && k != j && digits[k] % 2 == 0) {
number += digits[k];
set.add(number);
number -= digits[k];
}
}
number -= digits[j] * 10;
}
}
}
}
List<Integer> list = new ArrayList<>(set);
Collections.sort(list);
int[] ans = new int[list.size()];
for (int i = 0; i < list.size(); i++) {
ans[i] = list.get(i);
}
return ans;
}
}
}