数组中出现次数超过一半的数字 --剑指offer

public class Solution {
        public int MoreThanHalfNum_Solution(int [] array) {
        int count=1;
        int num=array[0];
        for(int i=0;i<array.length;i++){
            if(count == 0){
                num=array[i];
                count=1;
            }else {
                if(array[i] == num){
                    count ++;
                }else {
                    count --;
                }
            }
        }
        count =0;
        for(int i =0;i <array.length;i ++){
            if(array[i] == num){
                count ++;
            }

        }
        return count*2>array.length?num:0;
    }
}