数组中出现次数超过一半的数字

public int MoreThanHalfNum_Solution(int [] array) {
        int survivor=array[0];
        int count=1;
        for(int i=1;i<array.length;i++){
            if (array[i]==survivor)
                count++;
            else if (array[i]!=survivor){
                count--;
            }
          //当count=0，保存下一个数
            if ( count == 0 ){
                survivor = array [i];
                count = 1 ;
            }
        }
        count=0;
        for(int i=0;i<array.length;i++){
            if (array[i]==survivor){
             count++;
            }
        }
        if (count>array.length/2){
            return survivor;
        }else {
            return 0;
        }
    }