本文主要是介绍169. 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 flag=1,x=nums[0];for(int i=1;i<nums.size();i++){if这篇关于169. Majority Element(关于摩尔投票法)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
