qq_30339595的博客

思路一：库函数（一行）class Solution: def topKFrequent(self, nums: List[int], k: int) -> List[int]: return [item[0] for item in collections.Counter(nums).most_common(k)]思路二：堆class Solution:...

const int maxn=100;int heap[maxn];int n;void downadjust(int low,int high){//下沉，其实为了是把下一层大的数浮上来。 int i=low,j=2*i; while(j<=high){ if(j+1<=high&&heap[j+1]>heap[j])swap(heap[j+1]...