C语言 动态数组实现

#include <stdio.h>
#include <stdlib.h>

/**************************************************
dynamicArrayOneDimensional.c
输入N个数，求平均数
**************************************************/
main()
{
  int *p = NULL, n, i, sum;
  printf("Please enter array size:");
  scanf("%d", &n);

  /* 申请地址n个长度为sizeof(int)的连续存储空间 */
  p = (int *)malloc(n * sizeof(int));

  if(p == NULL)
  {
      printf("No enough memory!\n");
      exit(0);
  }

  printf("Please enter the score:");
  for(i = 0; i<n; i++)
  {
      scanf("%d", p+i);
  }

  sum = 0;
  for(i = 0; i<n; i++)
  {
      sum = sum + *(p + i);
  }

  printf("aver = %d\n", sum/n);
  free(p);

}

#include <stdio.h>
#include <stdlib.h>

int findMax(int *p, int m, int n, int *pRow, int *pCol);

int main()
{
  int *pScore = NULL, i, j, m, n, maxSocre, row, col;

  printf("Please enter array size m,n:");
  scanf("%d, %d", &m, &n);

  pScore = (int *) calloc(m*n, sizeof(int));
  if(pScore == NULL)
  {
      printf("No enough memory!\n");
      exit(0);
  }

  printf("Please enter the score:\n");
  for (i = 0; i < m; i++)
  {
      for (j = 0; j < n; j++)
      {
          scanf("%d", &pScore[i*n+j]);
      }
  }

  maxSocre = findMax(pScore, m, n, &row, &col);

  printf("maxSocre = %d, class = %d, number = %d\n", maxSocre, row+1, col+1);

  free(pScore);

  return 0;
}

int findMax(int *p, int m, int n, int *pRow, int *pCol)
{
  int i, j, max;

  max = p[0];
  *pRow = 0;
  *pCol = 0;
  for (i = 0; i < m; i++)
  {
      for (j = 0; j < n; j++)
      {
          if (p[i*n+j] > max)
          {
              max = p[i*n+j];
              *pRow = i;
              *pCol = j;
          }
      }
  }

  return (max);
}