leetCode练习（5）

题目：Longest Palindromic Substring

难度：medium

问题描述：

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of
S is 1000, and there exists one unique longest palindromic substring.

解题思路：

从第[I]个字符开始，依次向两边比较是否相等即可。注意奇数回文数和偶数回文数的比较有差池。代码如下：

public class Solution {
public String longestPalindrome(String s) {
if(s==null){
return "";
}
if(s.length()==1){
return s;
}
int len=s.length();
char[]	reverse={};
int	stringlen=0;
char[]	cs=new char[len];
for(int i=0;i