longestpalindromic

longestplaindromic.java

class Solution {
    public String longestPalindrome(String str) {
        
    int index1=0;
    int index2=0;
    boolean isPalin = true;
    if(str.length()==0) {
        return str;
    }
    if(str.length()==1) {
        return str;
    }
    
    int maxLength =0;
        
    for(int i=0;i<str.length()-1;++i) {
        for(int j=i+1; j<str.length(); ++j) {
            
            if(isPalin(str, i , j)) {
                
                if(j-i > maxLength) {
                    maxLength = j-i;
                    index1 = i;
                    index2 = j;
                
                }
            }
            
            
        }
    }
    
    StringBuilder sb = new StringBuilder();

        for(int k=index1; k <= index2; ++k) {
            sb.append(str.charAt(k));
        }

    System.out.println( str + " " + index1 + " " + index2);
    
    return sb.toString();
        
    }
    
    private boolean isPalin(String str, int a, int b) {
        while(a < b) {
            
            Character c1 = str.charAt(a);
            Character c2 = str.charAt(b);
            
            if(c1==c2) {
                a++;
                b--;
            }
            else {
                return false;
            }
            
        }
    
        return true;
    }
}