【C】求整型数组中的最大值 （党云龙、严晓雄）

#include"stdio.h"

int Largest(int list[], int length)
{
    int i;
    int j=1;
    int max=list[0];

    for(i = 0; i <= (length - 1); i ++ )
    {

      if((list[i]<-2147483648) && (list[i]>2147483647))
      {
         
          return 0;
      }
      else
      {
          if(list[i]>=max) 
          {
              max=list[i];
             
           }
      }
    }

        return max;
     
}

void main()
{
    int Tlist[3]={NULL};
    printf("NULL");
    printf("\n%d\n",Largest(Tlist,0));
    int Tlist1[3]={7,8,9};
    printf("7,8,9");
    printf("\n%d\n",Largest(Tlist1,3));
    int Tlist2[3]={0};
    printf("0");
    printf("\n%d\n",Largest(Tlist2,3));
    int Tlist3[3]={1,-2,9};
    printf("1,-2,9");
    printf("\n%d\n",Largest(Tlist3,3));
    int Tlist4[3]={-2,-2,-2};
    printf("-2,-2,-2");
    printf("\n%d\n",Largest(Tlist4,3));
    int Tlist5[1]={-2147483649};
    printf("-2147483649");
    printf("\n%d\n",Largest(Tlist5,1));
     int Tlist6[1]={2147483649};
    printf("2147483649");
    printf("\n%d\n",Largest(Tlist6,1));
}