算法 中等 | 47. 主元素 II

题目描述

给定一个整型数组，找到主元素，它在数组中的出现次数严格大于数组元素个数的三分之一。

样例1

输入: [99,2,99,2,99,3,3], 
输出: 99.

样例2

输入: [1, 2, 1, 2, 1, 3, 3], 
输出: 1.

java题解

public class Solution {
    public int majorityNumber(ArrayList<Integer> nums) {
        if (nums == null || nums.size() == 0) {
            return -1;
        }
        
        int num1 = 0;
        int num2 = 0;
        int count1 = 0;
        int count2 = 0;
        for (int i = 0; i < nums.size(); i++) {
            int newNum = nums.get(i);
            if (count1 == 0) {
                num1 = newNum;
                count1++;
            } else if (num1 == newNum) {
                count1++;
            } else if (count2 == 0) {
                num2 = newNum;
                count2++;
            } else if (num2 == newNum) {
                count2++;
            } else {
                count1--;
                count2--;
            }
        }
        
        count1 = 0;
        count2 = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (nums.get(i) == num1) {
                count1++;
            }
            
            if (nums.get(i) == num2) {
                count2++;
            }
        }
        
        return count1 > count2 ? num1 : num2;
    }
}

C++题解

class Solution {
public:
    int majorityNumber(vector<int> nums) {
        if(nums.size() == 0) return -1;
        
        int n = nums.size();
        int m1 , m2, majority;
        int c1 = 0, c2 = 0, count = 0;
        
        for(int i = 0; i < n; i++){
                        
            if(nums[i] == m1){
                c1++;
                continue;
            }
            else if(nums[i] == m2){
                c2++;
                continue;
            }
            
            if(c1 == 0){
                m1 = nums[i];
                c1++;

            }
            else if(c2 == 0){
                m2 = nums[i];
                c2++;
            }
            else{
                c1--;
                c2--;
            }
        }
        c1 = 0;
        c2 = 0;
        for(int i = 0; i < n; i++){
            if(nums[i] == m1){
                c1++;
                if(c1 > n / 3) return m1;
            }
            if(nums[i] == m2){
                c2++;
                if(c2 > n / 3) return m2;
            }
        }
        return -1;
    }
};

python题解

class Solution:
    def majorityNumber(self, nums):
        table = {}
        for i, num in enumerate(nums):
            if num not in table:
                table[num] = 1
            else:
                table[num] += 1
        
        for key, value in table.items():
            if value > len(nums) // 3:
                return key