題目
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.
解題思路
遍歷數(shù)組nums，將元素放入map中瘦陈，值為元素的數(shù)量凝危，如果某元素?cái)?shù)量已經(jīng)大于 ? n/2 ? ，則該元素就是要找的主要元素
代碼
func majorityElement(nums []int) int {
var ret int
var majorityMap map[int]int
majorityMap = make(map[int]int)
len1 := len(nums)
for i := 0; i < len1; i++{
num := nums[i]
majorityMap[num]++
if majorityMap[num] > len1/2 {
ret = num
break
}
}
return ret
}
