add one more solution for 1086

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_1086.java

@@ -3,6 +3,7 @@
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.List;
+import java.util.PriorityQueue;
 import java.util.TreeMap;
 
 /**
@@ -53,4 +54,35 @@ public int[][] highFive(int[][] items) {
             return result;
         }
     }
+
+    public static class Solution2 {
+        public int[][] highFive(int[][] items) {
+            TreeMap<Integer, PriorityQueue<Integer>> treeMap = new TreeMap<>();
+            for (int[] studentToScores : items) {
+                if (treeMap.containsKey(studentToScores[0])) {
+                    PriorityQueue<Integer> maxHeap = treeMap.get(studentToScores[0]);
+                    maxHeap.offer(studentToScores[1]);
+                    if (maxHeap.size() > 5) {
+                        maxHeap.poll();
+                    }
+                    treeMap.put(studentToScores[0], maxHeap);
+                } else {
+                    PriorityQueue<Integer> maxHeap = new PriorityQueue<>();
+                    maxHeap.offer(studentToScores[1]);
+                    treeMap.put(studentToScores[0], maxHeap);
+                }
+            }
+            int[][] result = new int[treeMap.size()][2];
+            for (int id : treeMap.keySet()) {
+                result[id - 1][0] = id;
+                int sum = 0;
+                PriorityQueue<Integer> maxHeap = treeMap.get(id);
+                while (!maxHeap.isEmpty()) {
+                    sum += maxHeap.poll();
+                }
+                result[id - 1][1] = sum / 5;
+            }
+            return result;
+        }
+    }
 }

src/test/java/com/fishercoder/_1086Test.java

@@ -8,11 +8,13 @@
 
 public class _1086Test {
     private static _1086.Solution1 solution1;
+    private static _1086.Solution2 solution2;
     private static int[][] items;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _1086.Solution1();
+        solution2 = new _1086.Solution2();
     }
 
     @Test
@@ -36,4 +38,25 @@ public void test1() {
         }, solution1.highFive(items));
     }
 
+    @Test
+    public void test2() {
+        items = new int[][]{
+                {1, 91},
+                {1, 92},
+                {2, 93},
+                {2, 97},
+                {1, 60},
+                {2, 77},
+                {1, 65},
+                {1, 87},
+                {1, 100},
+                {2, 100},
+                {2, 76}
+        };
+        assertArrayEquals(new int[][]{
+                {1, 87},
+                {2, 88}
+        }, solution2.highFive(items));
+    }
+
 }