Enter a string to output the longest palindrome substring. When the longest palindrome string is more than one, the output is all.
#include <iostream> #include <string>using namespace std; #define N 100string Convert (string s) {string out= "" ; int len=s.length (); for (int i=len-1;i>=0;i--) { Out.insert (out.length (), 1,s[i]);} return out;} void process (string r) {int len=r.length (); string *str = new String[n];for (int i=0;i<n;i++) {str[i]= "}";} int M=0;for (i=0;i<len;i++) {for (int j=len-1;j>= (i+1); j--) { if (r.substr (i,j-i+1) ==convert (R.substr (i,j-i +1)) { str[m++]=r.substr (i,j-i+1);}}} for (int. k=0;k<m;k++) Cout<<str[k]<<endl;cout<<endl;int maxlen=str[0].length (); for (k=1;k<m ; k++) if (Maxlen<str[k].length ()) maxlen=str[k].length (); for (k=0;k<m;k++) if (Maxlen==str[k].length ()) cout <<str[k]<<endl;} void Main () {string in; Getline (cin,in);p rocess (in);
test results, may not be thoughtful, welcome to check the leak:
Huawei Machine test-longest palindrome string