leecode-C语言实现-5. 最长回文子串

一、题目

二、解题思路
（1）思路一
举例：字符串为babad
1、取第一个元素b和最后一个元素d到第二元素a进行比较，b和d不等下一个，b和a不等下一个，b和b相等，第一个元素b向后移动一位，第三个元素b向前移动一位，看是否相等，直到把两者之间的元素都比对完，确认bab是回文数。

2、取第二个元素a和最后一个元素d到第三元素b进行比较，a和d不等下一个，a和b相等，第二个元素a向后移动一位，第四个元素a向前移动一位，看是否相等，直到把两者之间的元素都比对完，确认aba是回文数，之后的元素同上。

（2）思路一之优化
举例：字符串为baccabad
1、就之前算法加上一个逻辑判断，我拿到的第一个回文数是baccab，长度是6，此数据中还有很多其他的回文数例如:acca、aba。但这些都不是我想要的结果，因为长度小于6，再进一步推断，遍历的两个元素之间相差小于等于6的，我们可以直接跳出循环，这样可以使代码效率提升一定的程度，在没有优化前，代码在leecode中运行是超时的，加完可以通过此题。

三、虚机测试代码

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

void main()
{
    char * longestPalindrome(char * s);
    void PrintfArr(void *arr, int size ,int elementsize);
    
    int i;
    char s[] = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabcaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
    //PrintfArr(s, sizeof(s) / sizeof(char) , sizeof(char));
    char *res = longestPalindrome(s);

    for(i=0; res[i] != '\0'; i++)
    {
        printf("%c",res[i]);
    }
    printf("\n");
}

char * longestPalindrome(char * s)
{

    int JudgePalindrome(char *s,int top,int end);
    int ComputeArrLen(int top,int end);

    int StrSize = strlen(s);

    if(StrSize == 1)
    {
        return s;
    }

    int len = 0;
    int IndexArr[2] = {0,0};
    int x,y;
    int flg = 0;

    for(x=0; x<StrSize; x++)
    {
        for(y=StrSize-1; y>x; y--)
        {
            //printf("s[%2d] : %c, s[%2d] : %c, len : %2d, IndexArr[0] : %2d, IndexArr[1] : %2d\n",x,s[x],y,s[y],len,IndexArr[0],IndexArr[1]);
            if(ComputeArrLen(x,y) <= len)
            {
                break;
            }
            else if(s[x] == s[y] && JudgePalindrome(s,x,y))
            {
                if(len < y - x + 1)
                {
                    len = y - x + 1;
                    IndexArr[0] = x;
                    IndexArr[1] = y;
                    flg = 1;
                }
            }
        }
    }
    int i,j;
    if(!flg)
    {
        len = 2;
        char *res = malloc(sizeof(char) * len);
        res[0] = s[0];
        res[1] = '\0';
        return res;
    }
    char *res = malloc(sizeof(char) * (len + 1));
    for(i=IndexArr[0],j=0; i<=IndexArr[1] && i>=IndexArr[0]; i++,j++)
    {
        res[j] = s[i];
    }
    res[j] = '\0';
    return res;
}

int ComputeArrLen(int top,int end)
{
    return end - top + 1;
}

int JudgePalindrome(char *s,int top,int end)
{
    int tmp;
    int x = top;
    int y = end;
    if((end - top + 1) % 2 == 0)
    {
        tmp = (end - top + 1) / 2 - 1;
        if(tmp == 0)
        {
            return 1;
        }
        for(; (top <= x + tmp) && (end >= y - tmp); top++,end--)
        {
            //printf("s[%2d] : %c, s[%2d] : %c, tmp : %d\n",top,s[top],end,s[end],tmp);
            if(s[top] != s[end])
            {
                return 0;
            }
        }
    }
    else
    {
        tmp = (end - top + 1 + 1) / 2 - 1;
        if(tmp == 0)
        {
            return 1;
        }
        for(; (top < x + tmp) && (end > x + tmp); top++,end--)
        {
            //printf("s[%2d] : %c, s[%2d] : %c, tmp : %d\n",top,s[top],end,s[end],tmp);
            if(s[top] != s[end])
            {
                return 0;
            }
        }
    }
    //printf("++++++++++++++++++++++++\n");
    return 1;
}


void PrintfArr(void *arr, int size ,int elementsize)
{
    if(elementsize == sizeof(int))
    {
        int *tmparr = (int*)arr;
        int i;
        for(i=0; i<size; i++)
        {
            printf("%d ",tmparr[i]);
        }
    }
    else if(elementsize == sizeof(char))
    {
        char *tmparr = (char*)arr;
        int i;
        for(i=0; i<size; i++)
        {
            printf("%c ",tmparr[i]);
        }
    }
    printf("\n========================\n");
}

四、虚机代码运行截图
测试字符串为：

“aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabcaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa”;

此字符串中间有bc。

（1）优化前运行时间

（2）优化后运行时间

五、leecode提交代码

char * longestPalindrome(char * s)
{
    int JudgePalindrome(char *s,int top,int end);
    int ComputeArrLen(int top,int end);
    int StrSize = strlen(s);
    if(StrSize == 1)
    {
        return s;
    }
    int len = 0;
    int IndexArr[2] = {0,0};
    int x,y;
    int flg = 0;
    for(x=0; x<StrSize; x++)
    {
        for(y=StrSize-1; y>x; y--)
        {
            if(ComputeArrLen(x,y) <= len)
            {
                break;
            }
            else if(s[x] == s[y] && JudgePalindrome(s,x,y))
            {
                if(len < y - x + 1)
                {
                    len = y - x + 1;
                    IndexArr[0] = x;
                    IndexArr[1] = y;
                    flg = 1;
                }
            }
        }
    }
    int i,j;
    if(!flg)
    {
        len = 2;
        char *res = malloc(sizeof(char) * len);
        res[0] = s[0];
        res[1] = '\0';
        return res;
    }
    char *res = malloc(sizeof(char) * (len + 1));
    for(i=IndexArr[0],j=0; i<=IndexArr[1] && i>=IndexArr[0]; i++,j++)
    {
        res[j] = s[i];
    }
    res[j] = '\0';
    return res;
}
int ComputeArrLen(int top,int end)
{   
    return end - top + 1;
}
int JudgePalindrome(char *s,int top,int end)
{
    int tmp;
    int x = top;
    int y = end;
    if((end - top + 1) % 2 == 0)
    {
        tmp = (end - top + 1) / 2 - 1;
        if(tmp == 0)
        {
            return 1;
        }
        for(; (top <= x + tmp) && (end >= y - tmp); top++,end--)
        {
            if(s[top] != s[end])
            {
                return 0;
            }
        }
    }
    else
    {
        tmp = (end - top + 1 + 1) / 2 - 1;
        if(tmp == 0)
        {
            return 1;
        }
        for(; (top < x + tmp) && (end > x + tmp); top++,end--)
        {
            if(s[top] != s[end])
            {
                return 0;
            }
        }
    }
    return 1;
}

六、leecode提交结果