#include <stdio.h>
#include <stdlib.h>
int *max_divide(char s[][20] , int columnSize)
{
   if(columnSize < 0)return NULL;
   int* retArr = (int*)malloc(sizeof(int)*columnSize);
   int max,min;
   for(int i=0;i < columnSize;i++)
   {
        max=s[i][0];
        min=s[i][0];
       for(int j = 0;s[i][j]!='\0';j++)
       {

            if(s[i][j] > max)max = s[i][j];
            if(s[i][j] < min)min = s[i][j];
       }//找出這組的極大小值 找完再開始分割
    if(s[i][0]==max&&s[i][0]==min)//situation 1:陣列裡面都長一樣
           {
               int count = 0;
               while(s[i][count]!='\0')
               {
                   count++;
               }
               retArr[i]=count;
               continue;
           }
    if(s[i][0]==max)//situation 2:陣列第一個剛好是最大值 那最多只能切割一組
    {
        retArr[i]=1;
        continue;
    }


    }

   return retArr;
}
int main()
{

    char s [2][20]={"1111111","321"};
    int*arr =max_divide( s , 2);
    printf("%d\n",arr[0]);
    printf("%d",arr[1]);
    return 0;
}