04. Find longest palindrome from a String - prabhatrocks07/Core-Java-Programming GitHub Wiki

package com.java.program;

public class BigPalindrome {

public static void main(String[] args) {
	
	System.out.println("--- The String is ----");
	String bigString = "aaabbaaaccdeqjncsddmmmkkkmmmddd";
	System.out.println(bigString);
	
	String bigPal = "";
	for (int i = 0; i < bigString.length(); i++) {
		for (int j = i + 1; j < bigString.length(); j++) {
			String subStr = bigString.substring(i, j);
			
			if(isPalindrome(subStr)) {
				bigPal = subStr.length() > bigPal.length() ? subStr : bigPal;
			}
		}
	}

	System.out.println("Big Pallin : " + bigPal);
}

private static boolean isPalindrome(String input) {
	boolean isPalindrome = true;
	
	if(input != null) {
		int length = input.length();
		for (int i = 0; i < length/2; i++) {
			if(input.charAt(i) != input.charAt(length -1 - i)) {
				isPalindrome = false;
                                    break;
			}
		}
	}
	return isPalindrome;
}

/*private static boolean isPalindrome(String input) {
	boolean isPalindrome = false;
	
	if(input != null) {
		String s = "";
		int length = input.length();
		for (int i = length - 1; i >= 0; i--) {
			s = s + input.charAt(i);
		}
		
		if(input.equals(s)) {
			isPalindrome = true;
		}
	}
	return isPalindrome;
}*/
}