Leetcode-Basic/LuckyInteger.java at main · kavya-7777/Leetcode-Basic · GitHub

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
<<<<<<< HEAD
//1394. Find Lucky Integer in an Array

class Solution {
    public int findLucky(int[] arr) {
        int n = arr.length;
        int[] freq = new int[502];
        for(int num : arr){
            freq[num]++;
        }
        for(int i=501;i>=1;i--){
            if(freq[i] == i){
                return i;
            }
        }
        return -1;
    }
}

/*
class Solution {
    public int findLucky(int[] arr) {
        int[] freq = new int[arr.length];
        for(int i=0;i<arr.length;i++){
            int count = 1;
            for(int j=i+1;j<arr.length;j++){
                if(arr[i] == arr[j]){
                    count ++;
                    freq[j] = -1;
                }
            }
            if(freq[i] != -1){
                freq[i] = count;
            }
        }
        int max = -1;
        for(int i=0;i<freq.length;i++){
            if(freq[i]==arr[i] && arr[i]>max){
                max = arr[i];
            }
        }
        return max;
    }
}
=======
//1394. Find Lucky Integer in an Array

class Solution {
    public int findLucky(int[] arr) {
        int n = arr.length;
        int[] freq = new int[502];
        for(int num : arr){
            freq[num]++;
        }
        for(int i=501;i>=1;i--){
            if(freq[i] == i){
                return i;
            }
        }
        return -1;
    }
}

/*
class Solution {
    public int findLucky(int[] arr) {
        int[] freq = new int[arr.length];
        for(int i=0;i<arr.length;i++){
            int count = 1;
            for(int j=i+1;j<arr.length;j++){
                if(arr[i] == arr[j]){
                    count ++;
                    freq[j] = -1;
                }
            }
            if(freq[i] != -1){
                freq[i] = count;
            }
        }
        int max = -1;
        for(int i=0;i<freq.length;i++){
            if(freq[i]==arr[i] && arr[i]>max){
                max = arr[i];
            }
        }
        return max;
    }
}
>>>>>>> be6ce0b427078b1421d5dd74adb2300dc02daeec
*/