add 1090

fishercoder1534 · fishercoder1534 · commit e906334820f2 · 2020-11-20T07:11:42.000-08:00
diff --git a/README.md b/README.md
@@ -238,6 +238,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | |Easy|Math|
 |1100|[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1100.java) | |Medium|String, Sliding Window|
 |1099|[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) |  [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI)|Easy||
+|1090|[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1090.java) | |Medium|HashTable, Greedy|
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | |Easy||
 |1087|[Brace Expansion](https://leetcode.com/problems/brace-expansion/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1087.java) | |Medium|Backtracking|
 |1086|[High Five](https://leetcode.com/problems/high-five/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc)|Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1090.java b/src/main/java/com/fishercoder/solutions/_1090.java
@@ -0,0 +1,36 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+public class _1090 {
+    public static class Solution1 {
+        public int largestValsFromLabels(int[] values, int[] labels, int numWanted, int useLimit) {
+            int[][] tuple = new int[values.length][2];
+            for (int i = 0; i < values.length; i++) {
+                tuple[i][0] = values[i];
+                tuple[i][1] = labels[i];
+            }
+            Arrays.sort(tuple, (a, b) -> b[0] - a[0]);
+            Map<Integer, Integer> labelUsedCountMap = new HashMap<>();
+            int sum = 0;
+            int numbersUsed = 0;
+            for (int i = 0; i < values.length; i++) {
+                int val = tuple[i][0];
+                int usedCount = labelUsedCountMap.getOrDefault(tuple[i][1], 0);
+                if (usedCount >= useLimit) {
+                    continue;
+                } else {
+                    sum += val;
+                    numbersUsed++;
+                    labelUsedCountMap.put(tuple[i][1], usedCount + 1);
+                }
+                if (numbersUsed >= numWanted) {
+                    break;
+                }
+            }
+            return sum;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1090Test.java b/src/test/java/com/fishercoder/_1090Test.java
@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1090;
+import com.fishercoder.solutions._28;
+import org.junit.Before;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1090Test {
+    private static _1090.Solution1 solution1;
+
+    @Before
+    public void setupForEachTest() {
+        solution1 = new _1090.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(9, solution1.largestValsFromLabels(new int[]{5, 4, 3, 2, 1}, new int[]{1, 1, 2, 2, 3}, 3, 1));
+    }
+
+}
