程序改错---在一个3x4矩阵中找出最大数及最大数所在元素的下标。
2022年 02月 17 日

BIGFISH

#include 
#define M 3
#define N 4
void FindMax(int(*p)[N], int m, int n, int pRow, int pCol ,int maxScore);

main()
{
    int score[M][N], i, j, maxScore = -1, row = -1, col = -1;
    for (i = 0; i < M; i++)
    {
        for (j = 0; j < N; j++)
        {
            scanf("%d", &score[i][j]);
        }
    }

    FindMax(score, M, N, row, col , maxScore);

   // printf("%d %d %d\n", maxScore, row + 1, col + 1);
}

void FindMax(int(*p)[N], int m, int n,int pRow, int pCol , int maxScore)
{
    int  i, j;
    maxScore = *(p)[0];
    for (i = 0; i < m; i++)
    {
        for (j = 0; j < n; j++)
        {
            if (*(*(p + i) + j) > maxScore)
            {
                maxScore = *(*(p + i) + j);
                //printf("ggg%d", maxScore);
                pRow = i;
                pCol = j;
            }
        }
    }

    printf("%d %d %d\n", maxScore, pRow + 1, pCol + 1);

}

程序改错---在一个3x4矩阵中找出最大数及最大数所在元素的下标。

#include 
#define M 3
#define N 4
void FindMax(int(*p)[N], int m, int n, int pRow, int pCol ,int maxScore);

main()
{
    int score[M][N], i, j, maxScore = -1, row = -1, col = -1;
    for (i = 0; i < M; i++)
    {
        for (j = 0; j < N; j++)
        {
            scanf("%d", &score[i][j]);
        }
    }

    FindMax(score, M, N, row, col , maxScore);

   // printf("%d %d %d\n", maxScore, row + 1, col + 1);
}

void FindMax(int(*p)[N], int m, int n,int pRow, int pCol , int maxScore)
{
    int  i, j;
    maxScore = *(p)[0];
    for (i = 0; i < m; i++)
    {
        for (j = 0; j < n; j++)
        {
            if (*(*(p + i) + j) > maxScore)
            {
                maxScore = *(*(p + i) + j);
                //printf("ggg%d", maxScore);
                pRow = i;
                pCol = j;
            }
        }
    }

    printf("%d %d %d\n", maxScore, pRow + 1, pCol + 1);

}

赞 (0)

猜您想看

评论区(暂无评论)

这里空空如也,快来评论吧~

我要评论