标签:
题目:
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.
我的解法:(1)算法思想:
初始化记count=1,majority element是maj=num[0]。顺序遍历数组一次即可:当遇到num[i]与maj相等时,count++。遇到num[i]与maj不相等时,如果count>=1,则count--;否则,令num[i]为新的maj,并重新计数count。
(2)代码如下:
标签:
原文地址:http://blog.csdn.net/littlebob180/article/details/42850915