使用C不工作时查找最长公共前缀的累积方法

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

char* longestCommonPrefix(char** strs, int strsSize) {
    if (strsSize == 0) {
        return "";
    }
    
    // 获取第一个字符串作为初始的最长公共前缀
    char* prefix = (char*)malloc(strlen(strs[0]) + 1);
    strcpy(prefix, strs[0]);
    
    for (int i = 1; i < strsSize; i++) {
        int j = 0;
        // 逐个比较当前字符串和最长公共前缀的字符
        while (prefix[j] != '\0' && strs[i][j] != '\0' && prefix[j] == strs[i][j]) {
            j++;
        }
        // 更新最长公共前缀
        prefix[j] = '\0';
    }
    
    return prefix;
}

int main() {
    char* strs[] = {"flower", "flow", "flight"};
    int strsSize = sizeof(strs) / sizeof(strs[0]);
    
    char* prefix = longestCommonPrefix(strs, strsSize);
    printf("Longest common prefix: %s\n", prefix);
    
    free(prefix);
    
    return 0;
}