-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlongestPalindrome.cpp
More file actions
43 lines (32 loc) · 1.03 KB
/
Copy pathlongestPalindrome.cpp
File metadata and controls
43 lines (32 loc) · 1.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include<iostream>
using namespace std;
string longestPalindrome(string myString, int i, int j);
int main () {
string myString = "dragongohangasalamiimalasagnahogasdf";
int size = myString.length();
int i = 0;
string p = longestPalindrome(myString, i, size-1);
cout << "longest Palindrome: "<< p<<endl;
system("pause");
}
string longestPalindrome (string myString, int i, int j){
int size = j;
if (j-i<1){
cout<<myString.substr(i,j-i+1)<<endl;
return myString.substr(i,j-i+1);}
else if (myString[i]==myString[j]) {
for (int k =i, v = j; k<v;k++,v--){
if(myString[k]!=myString[v])
break;
}
return myString.substr(i,j-i+1);
}
else {
string s=myString;
string myString1 = longestPalindrome(s, i+1,j);
string myString2 = longestPalindrome(s, i, j-1);
if (myString1.length()>=myString2.length())
return myString1 ;
else return myString2;
}
}