LeetCode：判断最长前缀

之前一直忽略了一个问题就是：给定的空字符串数组

 char* longestCommonPrefix(char** strs, int strsSize) {
     char* result;
     if(strsSize == 0) {
         result = (char *)malloc(sizeof(char) * 1);
         result[0] = '\0';
         return result;
     }

     int i=0;
     while(strs[0][i] != NULL && strs[0][i] != '\0') {
         i++;
     }

     int len = i==0 ? 2:i+1;
     result = (char *)malloc(sizeof(char) * len);

     for(i=0; i<len; i++) {
         char t = strs[0][i];    /* get first character of first string */
         if(t == '\0') {
             result[i] = '\0';
             return result;
         }
         int flag = 1;
         int j=0;
         for(j=0; j<strsSize; j++) /* traverse strings */
             if(strs[j][i] != t) {
                 flag = 0;            /* if not match then  */
                 t = '\0';
                 break;
             }
         result[i] = t;
         if(flag==0) {
             break;
         }
     }
     return result;
 }

还有遇到的错误是

empty character constant

 char t = '';

这种写法在C语言中是错误的