题目:数组中有一个数字出现的次数超过数组长度的一半,请找出这个数字。例如输入一个长度为9的数组{1,2,3,2,2,2,5,4,2}。由于数字2在数组中出现5次,超过数组长度的一半,因此输出2.
分析:有两种解法:
1.基于快速排序中的partition函数的O(n)算法。如果把这个数组排序,那么排序后的数组中间的数字一定是那个出现次数超过数组长度一半的数字。
2.根据数组特性,可以考虑遍历数组的时候保存两个值:一个是数组中的数字,一个是这个数字出现的次数。当我们遍历下一个数字的时候,如果下一个数字和之前保存的数字相同,则次数加1,否则次数减1.如果次数为0,我们需要保存下一个数字,并把次数设为1.
java代码:
package LinkList;
public class MoreThenHalfNumMain {
boolean g_bInputInvalid = false;
//方法一基于partition函数的O(n)算法
public int MoreThenHalfNum1(int[] num, int length) {
if (CheckInvalidArray(num, length))
return 0;
int middle = length >> 1;
int start = 0;
int end = length - 1;
int index = Partition(num, start, end);
while (index != middle) {
if (index > middle) {
end = index - 1;
index = Partition(num, start, end);
} else {
start = index + 1;
index = Partition(num, start, end);
}
}
int result = num[middle];
if (!CheckMoreThenHalf(num, length, result))
return 0;
return result;
}
//方法二根据数组的特点找出O(n)的算法
public int MoreThenHalfNum(int[] num, int length) {
if (CheckInvalidArray(num, length))
return 0;
int result = num[0];
int times = 1;
for (int i = 1; i < length; i++) {
if (times == 0) {
result = num[i];
times = 1;
} else if (num[i] == result) {
times++;
} else
times--;
}
if (!CheckMoreThenHalf(num, length, result))
return 0;
return result;
}
private boolean CheckMoreThenHalf(int[] num, int length, int result) {
int times = 0;
for (int i = 0; i < length; i++) {
if (num[i] == result)
times++;
}
boolean isMoreThenHalf = true;
if (times * 2 <= length) {
g_bInputInvalid = true;
isMoreThenHalf = false;
}
return isMoreThenHalf;
}
private int Partition(int[] a, int p, int q) {
int x, i, j, temp;
x = a[p]; // 将最后一个值保存在x中
i = p; // 开始的时候将i 移动到数组的外面
for (j = p + 1; j <= q; j++) {
if (a[j] <= x) // 比较比x大的数,并交换位置
{
i += 1;
temp = a[i]; // exchange
a[i] = a[j];
a[j] = temp;
}
}
temp = a[i]; // exchange
a[i] = a[p];
a[p] = temp;
return i;
}
private boolean CheckInvalidArray(int[] num, int length) {
g_bInputInvalid = false;
if (num == null || length <= 0)
g_bInputInvalid = true;
return g_bInputInvalid;
}
public static void main(String[] args) {
int a[] = { 1, 2, 3, 2, 2, 2, 5, 4, 2 };
MoreThenHalfNumMain moreThenHalfNumMain = new MoreThenHalfNumMain();
System.out.println(moreThenHalfNumMain.MoreThenHalfNum1(a, a.length));
System.out.println(moreThenHalfNumMain.MoreThenHalfNum(a, a.length));
}
}