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

public class Solution {    public int MoreThanHalfNum_Solution(int [] array) {        int vis[]=new int[10001];        for (int i = 0; i < array.length; i++) {            vis[array[i]]++;            if(vis[array[i]]*2>array.length)                return array[i];        }         return 0;    }}