-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
59 lines (53 loc) · 1.41 KB
/
main.go
File metadata and controls
59 lines (53 loc) · 1.41 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
// Source: https://leetcode.com/problems/find-lucky-integer-in-an-array
// Title: Find Lucky Integer in an Array
// Difficulty: Easy
// Author: Mu Yang <http://muyang.pro>
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// 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`
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
package main
func findLucky(arr []int) int {
freqs := make(map[int]int, len(arr))
for _, num := range arr {
freqs[num]++
}
ans := -1
for num, freq := range freqs {
if num == freq {
ans = max(ans, num)
}
}
return ans
}