1 solutions

  • 0
    @ 2024-12-10 21:47:36

    C :

    #include <stdio.h>
    int search(int *pa,int n,int *pmax,int *pflag);
    int main()
    {
    	int a[10],i,max,flag,pmax;
    	for(i=0;i<10;i++)
    		scanf("%d",&a[i]);
    
    	pmax=search(a,10,&max,&flag);
    
    	printf("Max is:%d\n",max);
    	printf("Max position is:%d",flag);
    }
    int search(int *pa,int n,int *pmax,int *pflag)
    {
    	int i,*max;
    	max=pmax;
    	*pmax=pa[0];
    	for(i=1;i<n;i++)
    	{
    		if(*pmax<pa[i])
    		{
    			*pmax=pa[i];
    			*pflag=i;
    		}
    	}
    	return *max;
    }
    
    • 1

    【设计型】第9章: 指针 9.15 谁是最大的(1)

    Information

    ID
    494
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By