[LeetCode] 1394. Find Lucky Integer in an Array

- Problem

1394. Find Lucky Integer in an Array

Given an array of integers arr, a lucky integer is an integer that has a frequency in the array equal to its value.

Return the largest lucky integer in the array. If there is no lucky integer return -1.

Example 1:

Input: arr = [2,2,3,4]
Output: 2
Explanation: The only lucky number in the array is 2 because frequency[2] == 2.

Example 2:

Input: arr = [1,2,2,3,3,3]
Output: 3
Explanation: 1, 2 and 3 are all lucky numbers, return the largest of them.

Example 3:

Input: arr = [2,2,2,3,3]
Output: -1
Explanation: There are no lucky numbers in the array.

Constraints:

• 1 <= arr.length <= 500
• 1 <= arr[i] <= 500

예제 1을 보면 arr = [2,2,3,4]인데 2가 총 2번 등장하였다.
그래서 예제 1의 lucky integer는 2다.

- 내 풀이

class Solution:
    def findLucky(self, arr: List[int]) -> int:
        c = collections.Counter(arr)
        result = [k for k, v in c.items() if k == v]
        return max(result) if result else -1

Counter method를 이용해서 풀면 끗.

문제를 풀고 discuss를 통해 다른 사람의 코드를 보던 중 똑같은 풀이지만 조금 더 간결한 코드를 봤다.

class Solution:
    def findLucky(self, arr: List[int]) -> int:
        c = collections.Counter(arr)
        return max([k for k, v in c.items() if k == v] + [-1])

ok. i got it.

- 결과