int main()
{
int a[111],max,min,*p,n,k = 0;
p = a;//指針p指向數組A的第壹個地址?
做{
scanf("%d ",& ampn);
p[k++]= n;
}while(getchar()!= ' \ n ');
max = min = p[0];
for(p = a;p & lta+k;p++)
{
if(* p & gt;最大)
max = * p;
if(* p & lt;最小)
min = * p;
}
printf("max=%d,min=%d ",max,min);
返回0;
}