545. 前K大数 II

class Solution:
    """
    @param: k: An integer
    """
    def __init__(self, k):
        # do intialization if necessary
        self.k = k 
        self.array = []

    """
    @param: num: Number to be added
    @return: nothing
    """
    def add(self, num):
        # write your code here
        self.array.append(num)

    """
    @return: Top k element
    """
    def topk(self):
        # write your code here
        
        array = []
        for i in self.array:
            array.append(i)
        
        return sorted(array)[:: -1][: self.k]

#堆方式实现
import heapq

class Solution:
    """
    @param: k: An integer
    """
    def __init__(self, k):
        # do intialization if necessary
        self.k = k 
        self.heap = []

    """
    @param: num: Number to be added
    @return: nothing
    """
    def add(self, num):
        # write your code here
        heapq.heappush(self.heap, num)

    """
    @return: Top k element
    """
    def topk(self):
        # write your code here
        
        return heapq.nlargest(self.k, self.heap)