Create LongestPalindromicSubstring.java

this code can solve problem in O(n^2) complexity. The key point is to notice that palindromic string always has a center, so just scan around that center is okay.