#include <iostream>
using namespace std;
// 在此处补充你的代码
int Compare1(void * n1,void * n2)
{
int * p1 = (int * )n1;
int * p2 = (int * )n2;
return ((*p1)%10) - ((*p2)%10);
}
int Compare2(void * n1,void * n2)
{
int * p1 = (int * )n1;
int * p2 = (int * )n2;
return *p1 - *p2;
}
#define eps 1e-6
int Compare3(void * n1,void * n2)
{
float * p1 = (float * )n1;
float * p2 = (float * )n2;
if( * p1 - * p2 > eps)
return 1;
else if(* p2 - * p1 > eps)
return -1;
else
return 0;
}
int main()
{
int t;
int a[10];
float d[10];
cin >> t;
while(t--) {
int n;
cin >> n;
for(int i = 0;i < n; ++i)
cin >> a[i];
for(int i = 0;i < n; ++i)
cin >> d[i];
int * p = (int *) MyMax(a,sizeof(int),n,Compare1);
cout << * p << endl;
p = (int *) MyMax(a,sizeof(int),n,Compare2);
cout << * p << endl;
float * pd = (float * )MyMax(d,sizeof(float),n,Compare3);
cout << * pd << endl;
}
return 0;
}
对每组数据:
第一行是整数n (1<=n<=10)
第2行是 n个整数
第3行是n个浮点数
先输出n个整数中个位数最大的数(答案保证唯一)
再输出n个整数中最大的数
再输出n个浮点数中最大的数
2 5 31 20 100 7 8 30.1 100.2 2.5 9.8 48.4 2 1 2 0.1 0.2
8 100 100.2 2 2 0.2
参照别人的:http://blog.youkuaiyun.com/qinghuan1/article/details/65635709
void *MyMax(void *a, unsigned int b, int n, int(*fun)(void *, void *))
{
int judge;
int *max = (int *)a;
for (int i = 1; i<n ; ++i)
{
judge = fun(max, (int *)a+i);
if (judge < 0)
max = (int *)a + i;
}
return max;
}
http://www.cnblogs.com/VincentValentine/p/5676318.html
void* MyMax(void* a, int width , int num, int (*compare)(void* p1,void* p2))
{
void* result = a;
for(int i=1; i<num; i++) {
if(compare(result, ((char*)a)+i*width)<0)
result = ((char*)a)+i*width;
}
return result;
}