Largest palindrome substring of a string?

Answer 1

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.util.Vector; /**

*

*/ /**

* @author omnipath

*

*/

public class Palindrome { /**

* @param args

*/

public static void main(String[] args) { // open up standard input

BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String string = null; // readLine() method try { string = br.readLine(); } catch (IOException ioe) { System.out.println("IO error trying to read input!"); System.exit(1); }

Palindrome palindromeCase = new Palindrome(string);

System.out.println("The longest palindrome is: " + palindromeCase.palindrome);

System.out.println("The length of the longest palindrome is: " + palindromeCase.palindrome.length());

System.out.println("Counter is: " + palindromeCase.PalindromeCounter);

} String originalString;

String palindrome;

Vector vectPalindromes;

int palindromeLength;

int PalindromeCounter; public Palindrome(String s) {

PalindromeCounter = 0;

this.palindrome = "";

this.palindromeLength = this.palindrome.length();

this.originalString = s;

this.calculateLongestPalindrome(s);

} public void calculateLongestPalindrome(String s) {

if (s.length() == 1) {

this.palindrome = this.originalString;

this.palindromeLength = this.palindrome.length();

} this.parseForPalindrome(this.originalString); } public void parseForPalindrome(String s) {

PalindromeCounter++;

if (s.length() -1; i--) {

sb.append(s.charAt(i));

}

return sb.toString();

}

}