求数组n中出现次数超过一半的数

int MoreThanHalfNum(vector<int> &nums)

{
assert(!nums.empty());
int can=nums[0];
int times=1;
const int n=nums.size();

for(int i=1;i<n;++i){

if(times==0)
can=nums[i];
if(can==nums[i])
++time;
else
--time;
}
}