LongestPalindrome.java

public class LongestPalindrome {

    public String longestPalindrome(String s) {
        if(s.length() <= 1) return s;
        
        int top = s.length() - 1;
        char[] input = s.toCharArray();
        String palindrome = String.valueOf(s.charAt(0));
        
        int low = 0;
        int high = top;
            
        
        for(low = 0; low <= top; low++) {
            for(high = top; high > low; high--) {
                if (input[low] != input[high]) continue;

                
                for (int k = j, puntTemp = i; k >= i; k--, puntTemp++) {
                    final bool isLastIt = k == low
                    if(isLastIt) {
                        final String candidate = s.substring(i,j);
                        if(candidate.length() >= palindrome.length()) {
                            palindrome = s.substring(i,j+1);
                            if(palindrome.length() >= length-i) return palindrome;
                        }
                    }
                    if (input[puntTemp] != input[k]) break;
                }
            }
        }
        return palindrome;
    }
}