refactor 347

fishercoder1534 · fishercoder1534 · commit bb01f36fe3e1 · 2018-03-12T20:42:36.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_347.java b/src/main/java/com/fishercoder/solutions/_347.java
@@ -25,6 +25,7 @@ public class _347 {
 	public static class Solution1 {
 		/**
 		 * Use buckets to hold numbers of the same frequency
+     * It's averaged at 30 ms on Leetcode.
 		 */
 		public List<Integer> topKFrequent(int[] nums, int k) {
 			Map<Integer, Integer> map = new HashMap();
@@ -55,7 +56,7 @@ public List<Integer> topKFrequent(int[] nums, int k) {
 
 	public static class Solution2 {
 		/**
-		 * Use hashtable and heap
+		 * Use hashtable and heap, it's averaged at 100 ms on Leetocde.
 		 */
 		public List<Integer> topKFrequent(int[] nums, int k) {
 			// construct the frequency map first, and then iterate through the map
@@ -66,15 +67,7 @@ public List<Integer> topKFrequent(int[] nums, int k) {
 			}
 
 			// build heap, this is O(logn)
-			Queue<Entry<Integer, Integer>> heap = new PriorityQueue<>((o1, o2) -> {
-				if (o1.getValue() > o2.getValue()) {
-					return -1;
-				} else if (o1.getValue() < o2.getValue()) {
-					return 1;
-				} else {
-					return 0;
-				}
-			});
+			Queue<Entry<Integer, Integer>> heap = new PriorityQueue<>((o1, o2) -> o2.getValue() - o1.getValue());
 			for (Entry<Integer, Integer> entry : map.entrySet()) {
 				heap.offer(entry);
 			}
