【Leetcode】：169. Majority Element 问题 in Go语言

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.

func majorityElement(nums []int) int {
    m := make(map[int]int)
    for i := 0; i < len(nums); i++ {
        num := nums[i]
        m[num] = m[num] + 1
        if m[num] > len(nums)/2{
            return num   
        }
    }
    return 0
}