https://leetcode-cn.com/problems/longest-palindromic-substring/
class Solution {
public String longestPalindrome(String s) {
String string="#";
int max=1,c = 0,l=0;
for(int i=0;i<s.length();i++) {
string=string+Character.valueOf(s.charAt(i)).toString()+"#";
}
for(int i=0;i<string.length();i++){
for(int j=0;;){
if (i-j<0||i+j>=string.length()){
if (j>max){
l=j-1;
c=i;
max=l;
}
break;
}else {
if (string.charAt(i-j)==string.charAt(i+j)){
j++;
}else {
if (j>max){
l=j-1;
c=i;
max=l;
}
break;
}
}
}
}
String ans="";
for (int i=c-l;i<=c+l;i++){
if(string.charAt(i)!='#'){
ans=ans+Character.valueOf(string.charAt(i)).toString();
}
}
return ans;
}
}