Longest Palindromic Substring

题目

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"

题解

/**
    算法总结： 

 */


/** 
 * 
 * 算法测试
 * 
 */

class Test {
    public static void main(String[] args) {
        System.out.println("测试结果"); 
        String str = "abacdefgeabcdef";


    }
}