-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathFindLuckyIntegerInArray1394.kt
51 lines (41 loc) · 1.06 KB
/
FindLuckyIntegerInArray1394.kt
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
package easy
/*
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
*/
fun findLucky(arr: IntArray): Int {
val map=HashMap<Int,Int>()
// map unique item array with occurrences˚
arr.forEach{
map[it]=(map[it]?:0) +1
}
var max=Int.MIN_VALUE
map.forEach{
if(it.key==it.value&& it.key>max)
{
max=it.key
}
}
return if(max!= Int.MIN_VALUE)
max
else
-1
}