add 2028

fishercoder1534 · fishercoder1534 · commit 9760d73b6fbb · 2021-10-03T08:24:45.000-07: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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ||Medium||
 |2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) ||Easy||
 |2023|[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2023.java) ||Medium||
 |2022|[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2028.java b/src/main/java/com/fishercoder/solutions/_2028.java
@@ -0,0 +1,26 @@
+package com.fishercoder.solutions;
+
+public class _2028 {
+    public static class Solution1 {
+        public int[] missingRolls(int[] rolls, int mean, int n) {
+            long sum = 0l;
+            for (int num : rolls) {
+                sum += num;
+            }
+            long totalSum = (rolls.length + n) * mean;
+            long remainder = totalSum - sum;
+            if (remainder / n > 6 || (remainder / n == 6 && remainder % n != 0) || remainder / n < 0 || remainder < n) {
+                return new int[]{};
+            }
+            int ave = (int) (remainder / n);
+            int remain = (int) (remainder % n);
+            int[] ans = new int[n];
+            int k = 0;
+            while (k < n) {
+                ans[k++] = ave + remain > 0 ? 1 : 0;
+                remain--;
+            }
+            return ans;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2028Test.java b/src/test/java/com/fishercoder/_2028Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2028;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _2028Test {
+    private static _2028.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2028.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{}, solution1.missingRolls(new int[]{4, 2, 2, 5, 4, 5, 4, 5, 3, 3, 6, 1, 2, 4, 2, 1, 6, 5, 4, 2, 3, 4, 2, 3, 3, 5, 4, 1, 4, 4, 5, 3, 6, 1, 5, 2, 3, 3, 6, 1, 6, 4, 1, 3}, 2, 53));
+    }
+
+}
