输入: "babad" 输出: "bab" 注意: "aba" 也是一个有效答案。
https://leetcode-cn.com/problems/longest-palindromic-substring/
思路:
1 从每一个回文对称点开始向左右遍历,直到左右字符不相等。求出最长子串。
2 考虑回文子串可能是奇数长度,对称点只有一个。也可能是偶数长度。对称点有俩个
#include<stdio.h>
#include<stdlib.h>
#include <string.h>
char * longestPalindrome(char * s, char *ps[2])
{
//char *p[2] = { NULL };
int lenth = strlen(s);
int left = 0;
int right = 0;
char *result = NULL;
int i = 0;
if (0==lenth)
{
return result;
}
for (i=0;i<lenth;i++)
{
//回文点在奇数个;
left = i;
right = i;
while (left > 0 && right < lenth - 1 && s[left-1] == s[right+1])
{
left--;
right++;
}
do
{
if (right - left==0)
{
break;
}
if ((right - left) % 2 == 0)//(right-left+1>1)
{
ps[0] = &s[left];
ps[1] = &s[right];
return ps;
}
} while (0);
}
for (i=0;i<lenth;++i)
{
//回文点在偶数cbbccc
if (s[i]==s[i+1])
{
left = i;
right = i+1;
while (left > 0 && right < lenth-1 && s[left-1] == s[right+1] )
{
left--;
right++;
}
do
{
if (right - left == 0)
{
break;
}
if ((right - left) % 2 == 1)//(right-left+1>1)
{
ps[0] = &s[left];
ps[1] = &s[right];
return ps;
}
} while (0);
}
}
return 0;
}
int main()
{
char str[21] = "abaji";
char *p[2] = { NULL };
longestPalindrome(str,p);
char *pp;
if (p[0]==NULL)
{
return 0;
}
else
{
for (pp = p[0]; pp <= p[1]; ++pp)
{
printf("%c ", *pp);
}
}
system("pause");
return 0;
}