algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-13 07:26:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2019-03-05 18:32:42 +08:00
parent c6cfc0a1cb
commit 351fb2e67c
1 changed files with 3 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -403,6 +403,9 @@ public List<Integer> topKFrequent(int[] nums, int k) {
} }
List<Integer> topK = new ArrayList<>(); List<Integer> topK = new ArrayList<>();
for (int i = buckets.length - 1; i >= 0 && topK.size() < k; i--) { for (int i = buckets.length - 1; i >= 0 && topK.size() < k; i--) {
if (buckets[i] == null) {
continue;
}
if (buckets[i].size() <= (k - topK.size())) { if (buckets[i].size() <= (k - topK.size())) {
topK.addAll(buckets[i]); topK.addAll(buckets[i]);
} else { } else {