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

Update Leetcode 题解.md

Browse Source
This commit is contained in:
CyC2018 2019-02-26 15:14:52 +08:00
commit cc9dd446f2
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

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