5. Longest Palindromic Substring

最新推荐文章于 2022-01-13 11:06:33 发布

TS1130

最新推荐文章于 2022-01-13 11:06:33 发布

阅读量354

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/TS1130/article/details/52653152

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

char* longestPalindrome(char* s) {
    int sSize = strlen(s);
    int maxBegan = 0;
    int maxLenth = 0, lenth = 0;
    for (int i = 0; i < sSize; i++)
    {
        int j = 1;
        int k = 0;
        while (s[i - j] == s[i + j] && j <= i && i + j < sSize)
        {
            k++;
            j++;
        }
        lenth = 2 * k + 1;
        if (lenth > maxLenth)
        {
            maxLenth = lenth;
            maxBegan = i - k;
        }

        j = 1;
        k = 0;
        if (s[i] != s[i+1])
        {
            continue;
        }
        while (s[i - j] == s[i + j + 1] && j <= i && i + j + 1 < sSize)
        {
            k++;
            j++;
        }
        lenth = 2 * k + 2;
        if (lenth > maxLenth)
        {
            maxLenth = lenth;
            maxBegan = i - k;
        }
    }
    char *arr = (char *)malloc(sizeof(char)*1001);
    strncpy(arr, &s[maxBegan], maxLenth);
    return arr;
}