letCode - Longest Palindromic Substring ( 1차 )

import java.util.*;

public class algo {
    public static void main(String[] args) {
        String s = "a";

        longestPalindrome(s);
    }
    
    public static boolean isPalindromic(String s) {
        StringBuffer sb = new StringBuffer(s);
        
        if (sb.toString().equals(sb.reverse().toString())) {
            return true;
        }
        
        return false;
    }

    public static String longestPalindrome(String s) {
        String answer = "";

        for (int i = 0; i < s.length(); i++) {
            for (int j = i; j < s.length(); j++) {
                String subS = s.substring(i, j + 1);
                if (isPalindromic(subS)) {
                    answer = (answer.length() > subS.length()) ? answer : subS;
                }
            }
        }

        System.out.println("answer = " + answer);

        return answer;
    }
}

 

결과 : timeLimit