edit 347

fishercoder1534 · fishercoder1534 · commit d76d1e6b1191 · 2017-07-15T17:06:33.000-07:00
diff --git a/README.md b/README.md
@@ -232,6 +232,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/IntersectionOfTwoArraysII.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/IntersectionOfTwoArrays.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
 |346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MovingAveragefromDataStream.java)| O(1)|O(w)) | Easy| Queue
 |344|[Reverse String](https://leetcode.com/problems/reverse-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ReverseString.java) | O(n) |O(1) | Easy | String
 |343|[Integer Break](https://leetcode.com/problems/integer-break/)|[Solution](../master/src/main/java/com/fishercoder/solutions/IntegerBreak.java)| O(1)|O(1) | Medium| Math
diff --git a/src/main/java/com/fishercoder/solutions/_347.java b/src/main/java/com/fishercoder/solutions/_347.java
@@ -9,15 +9,19 @@
 import java.util.PriorityQueue;
 import java.util.Queue;
 
-/**Given a non-empty array of integers, return the k most frequent elements.
+/**
+ * 347. Top K Frequent Elements
+ *
+ * Given a non-empty array of integers, return the k most frequent elements.
 
  For example,
  Given [1,1,1,2,2,3] and k = 2, return [1,2].
 
  Note:
  You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
  Your algorithm's time complexity must be better than O(n log n), where n is the array's size.*/
-public class TopKFrequentElements {
+
+public class _347 {
 	// Approach 1: use buckets to hold numbers of the same frequency
 	/**Attn: we must use a simple array to solve this problem, instead of using List<List<Integer>>, 
 	 * we have to use List<Integer>[], otherwise, cases like this one: [-1,-1] 
@@ -98,7 +102,7 @@ else if (o1.getValue() < o2.getValue())
 
 	public static void main(String[] args) {
 		int[] nums = new int[] { 3, 0, 1, 0 };
-		TopKFrequentElements test = new TopKFrequentElements();
+		_347 test = new _347();
 		test.topKFrequent_using_heap(nums, 1);
 //		test.topKFrequent_using_bucket(nums, 1);
 	}
