Given a string s, find the longest palindromic substring in s.
You may assume that the maximum length of s is 1000.
Example:
Input: “babad”
Output: “bab”
Note: “aba” is also a valid answer.
Example:
Input: “cbbd”
Output: “bb”
func longestPalindrome(s string) string {
l:=0
r:=0
var left int
var right int
for i:=0;i<len(s);i++{
if i<len(s)-1&&s[i]==s[i+1]{
left=i-1
right=i+2
for(left>=0&&right<len(s)){
if(s[left]==s[right]){
left--
right++
}else{
break
}
}
if(right-left-2>r-l){
l=left+1
r=right-1
}
}
left=i-1
right=i+1
for left>=0&&right<len(s){
if(s[left]==s[right]){
left--
right++
}else{
break
}
}
if(right-1-left-1>r-l){
l=left+1
r=right-1
}
}
return s[l:r+1]
}