<span style="font-size:18px;">/*************************************************************************
> File Name: Longest_Palindromic_Substring.cpp
> Author:
> Mail:
> Created Time: 2014年08月24日 星期日 15时27分55秒
************************************************************************/
/*************************************************************************
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.
*************************************************************************/
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
// this is an ordinary way to solve this problem
int Solution1(const char *str)
{
int i,j;
int len = strlen(str);
int maxlen = 1;
for(i = 0; i <len; i++)
{
for(j = 1; j < len/2; j++)
{
if((i - j)>=0 && (i+j < len) && str[i-j] == str[i+j])
{
if(maxlen < j)
{
maxlen = j + 1;
}
}
else
{
break;
}
}
}
for(i = 0; i < len ; i++)
{
for(j = 1; j < len/2; j++)
{
if((i-j+1)>=0 && i+j < len && str[i-j+1]==str[i+j])
{
if(maxlen < j)
{
maxlen = j+1;
}
}
else
{
break;
}
}
}
printf("the maxlen is %d",maxlen);
}
int main()
{
const char *str = "dbhdcdhcddckjs";
Solution1(str);
}</span>
Longest_Palindromic_Substring
最新推荐文章于 2019-10-17 19:51:45 发布