Given an array of sizen, 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.
代码:
参考代码
Given an array of sizen, 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.