【leetcode】14. Longest Common Prefix

最新推荐文章于 2022-03-20 08:23:53 发布

TianXieErYang

最新推荐文章于 2022-03-20 08:23:53 发布

阅读量119

点赞数

分类专栏：算法 leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/tianxieeryang/article/details/85106929

版权

算法同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

leetcode

13 篇文章 0 订阅

订阅专栏

14. Longest Common Prefix

Problem
solution

Problem

Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string “”.

Example 1:

Input: [“flower”,“flow”,“flight”]
Output: “fl”
Example 2:

Input: [“dog”,“racecar”,“car”]
Output: “”
Explanation: There is no common prefix among the input strings.
Note:

All given inputs are in lowercase letters a-z.

solution

char* longestCommonPrefix(char** strs, int strsSize) {
    char* prefix = (char*)malloc(10000 * sizeof(char));
    char tmp;
    int flag = 1;
    int n = 0;
    int min = strlen(*strs);
    for (int j = 1; j < strsSize; j++) {
        if (min > strlen(*(strs + j))) {
            min = strlen(*(strs + j));
        }
    }
    if (min == 0)    return "";
    while (flag && *(*strs + n) != '\0') {
        for (int i = 1; i < strsSize; i++) {
            if (*(*strs + n) != *(*(strs + i) + n)) {
                flag = 0;
                break;
            }
        }
        if (flag == 1) {
            *(prefix + n) = *(*strs + n);
            n++;
        }
    }
    *(prefix + n + 1) = '\0';
    return prefix;
}