求数组中出现次数超过数组长度一半的元素

private static int halfNumber(int[] array) {
if (array == null || array.length == 0) {
return 0;
}
int element = 0, times = 0;
for (int i = 0; i < array.length; i++) {
if (times == 0) {
times++;
element = array[i];
} else if (element == array[i]) {
times++;
} else {
times--;
}
}
return element;
}