算法题——求数组中元素出现次数超过数组长度的一半

方法一：暴力算法

#define	_CRT_SECURE_NO_WARNINGS

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

void M_Half(int arr[], int k)
{
	int i = 0;
	int j = 0;
	int tmp;
	int count = 0;
	for (i = 0; i < k; i++)
	{
		for (j = 0; j < k -  - i; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				tmp = arr[j + 1];
				arr[j + 1] = arr[j];
				arr[j] = tmp;
				count++;
			}
		}
	}
	for (i = 0; i < k; i++)
	{
		if (arr[i] == arr[i + k / 2])
		{
			printf("存在%d在数组中重复超过一半\n", arr[i]);
			return;
		}
	}
	printf("不存在数字在数组中重复超过一半\n");
}
int main()
{
	int arr[] = { 1,2,3,2,2,2,5,4,2 };
	M_Half(arr, sizeof(arr) / sizeof(arr[0]));
 	system("pause");
	return 0;
}

方法二暴力算法优化，利用一次快排可以降低时间复杂度

int Sort (int arr[],int len,int left,int right)
{
	int tmp = arr[left];
	while (left < right)
	{
		while (arr[right] >= tmp && left < right)
		{
			if (right == left)
			{
				break;
			}
			right--;
		}
		arr[left] = arr[right];
		arr[right] = tmp;
		while (arr[left] <= tmp && left < right)
		{
			if (right == left)
			{
				break;
			}
			left++;
		}
		arr[right] = arr[left];
		arr[left] = tmp;
	}
	return left;
}

int Find_Most_Half(int arr[], int len)
{
	int ret =  Sort(arr, len, 0,len-1);
	int i = 1;
	int count = 0;
	while (ret != len/2)
	{
		ret = Sort(arr, len, i++, len - 1);
	}
	for (i = 0; i < len; i++)
	{
		if (arr[len / 2])
		{
			count++;
		}
	}
	if (count > 2 / len);
	{
		return arr[len / 2];
	}
}

int main()
{
	int arr[] = { 1,2,3,2,5,2,2,4,2 };
	int ret = Find_Most_Half(arr,sizeof(arr)/sizeof(arr[0]));
	printf("%d\n", ret);
	system("pause"); 
	return 0;
}