edit leetcode 347

xpluto · xpluto · commit 9b22f5e6afca · 2019-02-26T02:37:49.000+08:00
diff --git a/docs/notes/Leetcode 题解.md b/docs/notes/Leetcode 题解.md
@@ -404,7 +404,11 @@ public List<Integer> topKFrequent(int[] nums, int k) {
     List<Integer> topK = new ArrayList<>();
     for (int i = buckets.length - 1; i >= 0 && topK.size() < k; i--) {
         if (buckets[i] != null) {
-            topK.addAll(buckets[i]);
+            if (buckets[i].size() <= (k - topK.size())) {
+                topK.addAll(buckets[i]);
+            } else {
+                topK.addAll(buckets[i].subList(0, k - topK.size()));
+            }
         }
     }
     return topK;

Original file line number	Diff line number	Diff line change
`@@ -404,7 +404,11 @@ public List<Integer> topKFrequent(int[] nums, int k) {`
`404`	`404`	`List<Integer> topK = new ArrayList<>();`
`405`	`405`	`for (int i = buckets.length - 1; i >= 0 && topK.size() < k; i--) {`
`406`	`406`	`if (buckets[i] != null) {`
`407`		`- topK.addAll(buckets[i]);`
	`407`	`+ if (buckets[i].size() <= (k - topK.size())) {`
	`408`	`+ topK.addAll(buckets[i]);`
	`409`	`+ } else {`
	`410`	`+ topK.addAll(buckets[i].subList(0, k - topK.size()));`
	`411`	`+ }`
`408`	`412`	`}`
`409`	`413`	`}`
`410`	`414`	`return topK;`