标签：and col div class NPU inpu -- turn public
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element always exist in the array.
Example 1:
Input: [3,2,3] Output: 3
Example 2:
Input: [2,2,1,1,1,2,2] Output: 2
class Solution { public: int majorityElement(vector<int>& nums) { int num=1,ans=nums[0],n=nums.size(); for(auto i=1;i<n;++i){ if(ans!=nums[i]){ --num; if(num==0){ ans=nums[i+1]; } } else{ ++num; } } int N=0; for(auto i=0;i<n;++i){ if(nums[i]==ans){ ++N; } } return ans; } };
标签：and col div class NPU inpu -- turn public
原文地址：https://www.cnblogs.com/Mered1th/p/10591228.html
