refactor 347

fishercoder1534 · fishercoder1534 · commit c5ecfe515486 · 2018-03-12T08:20:39.000-07:00
diff --git a/README.md b/README.md
@@ -361,7 +361,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_350.java)| O(m+n)|O((m+n)) could be optimized | |Easy| HashMap, Binary Search
 |349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_349.java)| O(m+n)|O(min(m,n)) | |Easy| Two Pointers, Binary Search
 |348|[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_348.java)| O(1)|O(n) | |Medium| Design 
-|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_347.java)| O(n)|O(1) | |Medium| HashTable, Heap, Bucket Sort
+|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_347.java)| O(n)|O(k) k is is the number of unique elements in the given array | |Medium| HashTable, Heap, Bucket Sort
 |346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_346.java)| O(1)|O(w)) | |Easy| Queue
 |345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_345.java) | O(n) |O(1) | |Easy | String
 |344|[Reverse String](https://leetcode.com/problems/reverse-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) | O(n) |O(1) | |Easy | String
diff --git a/src/main/java/com/fishercoder/solutions/_347.java b/src/main/java/com/fishercoder/solutions/_347.java
@@ -67,14 +67,14 @@ 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;
-                }
-            });
+				if (o1.getValue() > o2.getValue()) {
+					return -1;
+				} else if (o1.getValue() < o2.getValue()) {
+					return 1;
+				} else {
+					return 0;
+				}
+			});
 			for (Entry<Integer, Integer> entry : map.entrySet()) {
 				heap.offer(entry);
 			}
@@ -86,5 +86,4 @@ public List<Integer> topKFrequent(int[] nums, int k) {
 			return res;
 		}
 	}
-
 }
diff --git a/src/test/java/com/fishercoder/_347Test.java b/src/test/java/com/fishercoder/_347Test.java
@@ -28,8 +28,10 @@ public void test1() {
         expected = new ArrayList<>(Arrays.asList(0, 3));
         /**Comment out until Leetcode addresses this test case:
          * https://discuss.leetcode.com/topic/44237/java-o-n-solution-bucket-sort/75
-         * Then I'll update this Solution1 code accordingly.*/
-//        assertEquals(expected, solution1.topKFrequent(nums, 2));
+         * Then I'll update this Solution1 code accordingly.
+         *
+         * My post is still un-addressed. - 3/12/2018*/
+        //assertEquals(expected, solution1.topKFrequent(nums, 2));
     }
 
     @Test
@@ -38,4 +40,11 @@ public void test2() {
         expected = new ArrayList<>(Arrays.asList(0, 3));
         assertEquals(expected, solution2.topKFrequent(nums, 2));
     }
+
+    @Test
+    public void test3() {
+        nums = new int[] {1, 1, 1, 2, 2, 3};
+        expected = new ArrayList<>(Arrays.asList(1, 2));
+        assertEquals(expected, solution1.topKFrequent(nums, 2));
+    }
 }
