#include <stdio.h>
void replaceMax(int arr[],int value)
{
??? int max = arr[0];
??? int index = 0;
??? int i;
??? for(i=1;i<5;i++)//1.2.3.4
??? {
??????? if(arr[i]>max)
??????? {
???????????? int max= arr[i] ;??????? //將數(shù)組中較大的數(shù)賦值給max
??????????? index = i;? //記錄當(dāng)前索引;index=4
??????? }?????????????? ?
??? } ?
??? arr[index] = value;//arr[i]=value={1.2.3.4}
}

int main()
{
??? int arr1[] = {10,41,3,12,22};
??? int arr2[] = {1,2,3,4,5};
??? int i;
??? replaceMax(arr1 , arr2[0]? ); //將數(shù)組arr1和數(shù)組arr2的第一個元素傳入函數(shù)中
??? for(i=0;i<5;i++)
??? {
??????? printf("%d\n",arr1[i]);?????????????? ?
??? }
??? return 0;?? ?
}