add 1817

fishercoder1534 · fishercoder1534 · commit e8a61507c601 · 2021-04-04T07:49:52.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1817|[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1817.java) ||Medium|HashTable|
 |1816|[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1816.java) ||Easy|String|
 |1813|[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1813.java) ||Medium|String|
 |1812|[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1812.java) ||Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1817.java b/src/main/java/com/fishercoder/solutions/_1817.java
@@ -0,0 +1,33 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
+import java.util.TreeMap;
+
+public class _1817 {
+    public static class Solution1 {
+        public int[] findingUsersActiveMinutes(int[][] logs, int k) {
+            Map<Integer, Set<Integer>> map = new HashMap<>();
+            for (int[] log : logs) {
+                int user = log[0];
+                if (!map.containsKey(user)) {
+                    map.put(user, new HashSet<>());
+                }
+                Set<Integer> set = map.get(user);
+                set.add(log[1]);
+            }
+            int[] result = new int[k];
+            TreeMap<Integer, Integer> treeMap = new TreeMap<>();
+            for (int key : map.keySet()) {
+                int uam = map.get(key).size();
+                treeMap.put(uam, treeMap.getOrDefault(uam, 0) + 1);
+            }
+            for (int key : treeMap.keySet()) {
+                result[key - 1] = treeMap.get(key);
+            }
+            return result;
+        }
+    }
+}
