Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

edit leetcode 347

Browse Source
This commit is contained in:
xPluto
2019-02-26 02:37:49 +08:00
parent 55b8121d93
commit 9b22f5e6af
1 changed files with 5 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/notes/Leetcode 题解.md
View File

@ -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) {
if (buckets[i].size() <= (k - topK.size())) {
topK.addAll(buckets[i]);
} else {
topK.addAll(buckets[i].subList(0, k - topK.size()));
}
}
}
return topK;