CV_YOU的博客

代码片段: int MoreThanHalfNum_Solution(vector<int> numbers) { int length = numbers.size(); if(length<=0){ return 0; } //判断数组中哪个数出现的频率最高 int num = numbers[0],count =1; for (...