题解 | n个数里出现次数大于等于n/2的数

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    int solve(vector<int>& nums) {
        // 摩尔投票算法
        int candidate = nums[0];
        int count = 1;
        
        // 投票过程
        for (int i = 1; i < nums.size(); i++) {
            if (count == 0) {
                candidate = nums[i];
                count = 1;
            } else if (nums[i] == candidate) {
                count++;
            } else {
                count--;
            }
        }
        
        return candidate;
    }
};

int main() {
    vector<int> nums;
    int num;
    
    // 读取输入
    while (cin >> num) {
        nums.push_back(num);
    }
    
    Solution solution;
    cout << solution.solve(nums) << endl;
    
    return 0;
}

import java.util.*;

public class Main {
    static class Solution {
        public int solve(int[] nums) {
            // 摩尔投票算法
            int candidate = nums[0];
            int count = 1;
            
            // 投票过程
            for (int i = 1; i < nums.length; i++) {
                if (count == 0) {
                    candidate = nums[i];
                    count = 1;
                } else if (nums[i] == candidate) {
                    count++;
                } else {
                    count--;
                }
            }
            
            return candidate;
        }
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] input = sc.nextLine().split(" ");
        
        int[] nums = new int[input.length];
        for (int i = 0; i < input.length; i++) {
            nums[i] = Integer.parseInt(input[i]);
        }
        
        Solution solution = new Solution();
        System.out.println(solution.solve(nums));
        
        sc.close();
    }
}

class Solution:
    def solve(self, nums):
        # 摩尔投票算法
        candidate = nums[0]
        count = 1
        
        # 投票过程
        for i in range(1, len(nums)):
            if count == 0:
                candidate = nums[i]
                count = 1
            elif nums[i] == candidate:
                count += 1
            else:
                count -= 1
        
        return candidate

# 读取输入
nums = list(map(int, input().split()))
solution = Solution()
print(solution.solve(nums))