class Solution {
public:
int MoreThanHalfNum_Solution(vector<int> numbers) {
int length = numbers.size();//算出来数组的长度
int i = 0;
int j = 0;
for (i = 0; i < length-1; i++)
{
for (j = 0; j < length - i - 1; j++)
{
if (numbers[j]>numbers[j+1])//如果前边的比后边的大那就进行交换
{
int temp = numbers[j];
numbers[j] = numbers[j+1];
numbers[j+1] = temp;
}
}
}
//到这里就是排序好了,相同的数据肯定是挨着了
int num = 0;
i = 0;
int temp = numbers[i];
for (i = 0; i < length; i++)
{
if (temp == numbers[i])
{
num++;
}
else
{