169 Majority Element – Easy¶
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.
Thoughts:¶
Use a counter for currently met element. Since the major element will eventually win no matter where it starts.