Leetcode18: Majority Element

本文主要是介绍Leetcode18: Majority Element，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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.

class Solution {
public:int majorityElement(vector<int>& nums) {int majority;int cnt = 0;for(int i=0; i<nums.size(); i++){if ( cnt ==0 ){majority = nums[i];cnt++;}else{majority == nums[i] ? cnt++ : cnt --;if (cnt >= nums.size()/2+1) return majority;}}return majority;}
};

这篇关于Leetcode18: Majority Element的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---