LeetCode Q169: 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.

Solution 1:
Using hash table:

Solution 2:
Actually there are many other solutoins, please see: Here

Round 2 solution: