给定字符串,寻找其最长回文子串
abcbaabcdcba => abcdcba
顺序查找:
#include <iostream>
#include <cctype>
#include <cstring>
using namespace std ;
#define MAXN 5000+10
char buf[MAXN] , s[MAXN] , pos[MAXN] ; //增加了pos数组,记录下每个字母的位置;
int main() {
int n , m , max = 0 ;
int i , j , k ;
int begin , end ;
fgets(buf,MAXN,stdin) ;
m = 0 ;
for (i = 0 ; i < strlen(buf) ; ++ i) {
if (isalpha(buf[i])) {
if (buf[i] <= 'z') {
pos[m] = i ;
s[m++] = buf[i]+32 ;
}
else {
pos[m] = i ;
s[m++] = buf[i] ;
}
}
}
for (i = 0 ; i < m ; ++ i) {
for (j = i ; j < m ; ++ j) {
int ok = 1 ;
for (k = i ; k <= j ; ++ k) {
if (s[k] != s[i+j-k]) {
ok = 0 ;
}
if (ok && j-i+1>max) {
begin = i ;
end = j ;
max = j-i+1 ;
}
}
}
}
for (i = pos[begin] ; i <= pos[end] ; ++ i) {
cout << buf[i] ;
}
cout << endl ;
cout << max << endl ;
return 0 ;
}
效率较高的代码,这个是从中间往两边进行扩展的,可以提高效率:
#include <iostream>
#include <cstring>
#include <cctype>
using namespace std ;
#define MAXN 5000+10
char buf[MAXN] , s[MAXN] ;
int pos[MAXN] ;
int main() {
int m , n , k , max = 0 ;
int begin , end ;
fgets(buf,MAXN,stdin) ;
n = strlen(buf) ;
m = 0 ;
for (int i = 0 ; i < n ; ++ i) {
if (isalpha(buf[i])) {
if (buf[i] <= 'z') {
pos[m] = i ;
s[m++] = buf[i]+32 ;
}
else {
pos[m] = i ;
s[m++] = buf[i] ;
}
}
}
cout << endl ;
for (int i = 0 ; i < m ; ++ i) {
for (int j = 0 ; i-j >= 0 && i+j < m ; ++ j) {
if (s[i-j] !=s[i+j]) {
break ;
}
if (j*2+1 > max) {
max = j*2+1 ;
begin = pos[i-j] ;
end = pos[i+j] ;
}
}
for (int j = 0 ; i-j >= 0 && i+j+1 < m ; ++ j) {
if (s[i-j] != s[i+j+1]) {
break ;
}
if (j*2+2>max) {
max = j*2+2 ;
begin = pos[i-j] ;
end = pos[i+j+1] ;
}
}
}
for (int i = begin ; i <= end ; ++ i) {
cout << buf[i] ;
}
cout << endl << max << " " << end-begin+1 << endl ;
return 0 ;
}