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.

Credits: Special thanks to @ts for adding this PRoblem and creating all test cases.

Subscribe to see which companies asked this question.

Show Tags Show Similar Problems

思路

思路是vector减去两个不同的数字后那个超过一半的数字还是不变的 ，通过不断去除两个不同的数来缩小范围

代码