169. Majority Element(Leetcode每日一题-2020.03.13)

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

Problem

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.

Example1

Input: [3,2,3]
Output: 3

Example2

Input: [2,2,1,1,1,2,2]
Output: 2

Solution

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

这篇关于169. Majority Element(Leetcode每日一题-2020.03.13)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---