소프트웨어에 대한 모든 것

LeetCode 풀기 - 347. Top K Frequent Elements 본문

알고리즘/LeetCode

LeetCode 풀기 - 347. Top K Frequent Elements

앤테바 2022. 2. 25. 11:45
반응형

347. Top K Frequent Elements

https://leetcode.com/problems/top-k-frequent-elements/

 

Top K Frequent Elements - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

문제)

솔루션1) Counter 객체 사용

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        counter = Counter(nums)
        return list(zip(*counter.most_common(k)))[0]

솔루션2) sorted() 사용

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        counter = Counter(nums)
        
        nums = list(counter.items())
        # count 내림차순 정렬
        nums = sorted(nums, key=lambda x: -x[1])
        
        nums = nums[:k]
        
        return list(zip(*nums))[0]

함께 보면 좋은 글:

2022.02.24 - [파이썬] - [파이썬] sorted() 정렬 함수 파헤치기

반응형
Comments