Leetcode-Basic/MajorityElement.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
<<<<<<< HEAD
//169. Majority Element

class Solution {
    public int majorityElement(int[] nums) {
        int count = 0;
        int candidate = 0;

        for(int num : nums){
            if(count == 0) candidate = num;
            count += (candidate == num)? 1 : -1;
        }

        return candidate;
    }
}

/*
class Solution {
    public int majorityElement(int[] nums) {
        int[] freq = new int[nums.length];
        for(int i=0;i<nums.length;i++){
            int count = 1;
            for(int j=i+1;j<nums.length;j++){
                if(nums[i]==nums[j]){
                    count ++;
                    freq[j] = -1;
                }
            }
            if(freq[i] != -1){
                freq[i] = count;
                if(count > (nums.length/2)) return nums[i];
            }
        }
        return 0;
    }
}
=======
//169. Majority Element

class Solution {
    public int majorityElement(int[] nums) {
        int count = 0;
        int candidate = 0;

        for(int num : nums){
            if(count == 0) candidate = num;
            count += (candidate == num)? 1 : -1;
        }

        return candidate;
    }
}

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