leetcode1394. Find Lucky Integer in an Array

Posted seyjs

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode1394. Find Lucky Integer in an Array相关的知识,希望对你有一定的参考价值。

题目如下:

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

Return a lucky integer in the array. If there are multiple lucky integers return the largest of them. 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.

Example 4:

Input: arr = [5]
Output: -1

Example 5:

Input: arr = [7,7,7,7,7,7,7]
Output: 7

Constraints:

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

解题思路:非常简单的题目。

代码如下:

class Solution(object):
    def findLucky(self, arr):
        """
        :type arr: List[int]
        :rtype: int
        """
        val = [0] * 501
        for i in arr:
            val[i] += 1
        for inx in range(len(val)-1,0,-1):
            if inx == val[inx]:
                return inx
        return -1

 

以上是关于leetcode1394. Find Lucky Integer in an Array的主要内容,如果未能解决你的问题,请参考以下文章

leetcode_easy_array1394. Find Lucky Integer in an Array

LeetCode1394-找出数组中的幸运数

数据结构_find_lucky_number(寻找幸运值)

LeetCode --- 1380. Lucky Numbers in a Matrix 解题报告

leetcode_easy_array1380. Lucky Numbers in a Matrix

51 nod 1394 1394 差和问题(线段树)