返回最长回文子串

力扣第五题查找最长回文子串

给你一个字符串 s，找到 s 中最长的回文子串。

public class L5_longString {

    public static String longestPalindrome(String s) {
        int start =0;
        int end =0;
        char [] str_char=s.toCharArray();
        int n = s.length();
        //1.遍历数组
        for (int i=0;i<n;i++){
            int high=i;
            int low =i;
            //2.查找重复的字母
            while (high<n-1&&str_char[high]==str_char[i+1]){
                high++;
            }
            //3.开始从中间向两边扩散
            i=high;
            while (low-1>=0&&high+1<n&&str_char[low-1]==str_char[high+1]){
                high++;
                low--;
            }
            //4.找到最大的字符串
            if (high-low>end - start){
                end=high;
                start=low;
            }

        }
        return s.substring(start,end+1);
    }
    public static void main(String[] args) {
        System.out.println(longestPalindrome("babad"));
    }
}