add 2094

fishercoder1534 · fishercoder1534 · commit 2949569e6a6a · 2021-12-04T20:09:55.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2094|[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) ||Easy||
 |2091|[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) ||Medium||
 |2090|[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) ||Medium||
 |2089|[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2094.java b/src/main/java/com/fishercoder/solutions/_2094.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+import java.util.*;
+
+public class _2094 {
+    public static class Soluiton1 {
+        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;
+        }
+    }
+}
