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.

Example 1:

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

Example 2:

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

# @param {Integer[]} nums
# @return {Integer}
def majority_element(nums)
  max = nil
  hash = Hash[nums.group_by{|x|x}.map{|k,v|[k,v.size]}]
  # hash.select{|k,v| new_a = k if v > hash.size/2}
  # p hash
  # p new_a
  hash.each { |k, v| max = k if v == hash.values.max }
  p max
end