@@ -0,0 +1,1001 @@
+/**%0A * Given a string S, find the longest palindromic substring in S. You may assume that the maximum %0A * length of S is 1000, and there exists one unique longest palindromic substring.%0A * @author Jun%0A *%0A */%0A%0Apublic class Solution %7B%0A    public String longestPalindrome(String s) %7B%0A      if(s == null)  return s;%0A      int len = s.length();%0A      String longest = new String();%0A      for(int i = 0; i %3C len; i++) %7B%0A        if (i+1%3Clen && s.charAt(i) == s.charAt(i+1))%0A            longest = palindromeSubstring(s, longest, i, i+1);%0A        longest = palindromeSubstring(s, longest, i, i);%0A      %7D%0A      return longest;%0A    %7D%0A    %0A    private static String palindromeSubstring(String s, String currentLongest, int start, int end) %7B%0A    %09while(start %3E=0 && end %3C s.length() && s.charAt(start) == s.charAt(end)) %7B%0A        start--; %0A        end++;%0A      %7D%0A      start++; %0A      if(end-start %3E currentLongest.length())%0A        return s.substring(start, end);%0A      else%0A      %09return currentLongest;%0A    %7D%0A%7D%0A

Create 005.java