05_Longest Palindromic Substring

1.Question

2.Solution

 public String longestPalindrome(String s) {
        int max = 0;
        String result = "";
        int len = s.length();
        for(int i = 1; i <= len ; i++){
            for(int j = 0; j < len - i + 1; j++){
                boolean flag = true;
                String temp = s.substring(j,j+i);
                for(int k = 0; k <= i/2;k++){
                    if(temp.charAt(k) == temp.charAt(i-k-1)){
                        continue;
                    }else{
                        flag = false;
                        break;
                    }
                }
                if(flag && max < i){
                    result = temp;
                }
            }
        }
        System.out.println(result);
        return result;
    }

 

3.Test