Program for Longest Palindromic Subsequence

CODE


public static void method1(String input1)
{
String b="";
int max1=0;
for(int i=0;i<=input1.length();i++)
{
for(int j=i+2;j<=input1.length();j++)
{
b=(String)input1.subSequence(i,j);
max1=pali(b);
if(max1>output1)
{
output1=max1;
}
}
}
System.out.println(output1);
}
public static int pali(String s)
{
int max=0;
String reverse="";
for ( int i = s.length()- 1 ; i >= 0 ; i-- )
{
reverse = reverse + s.charAt(i);
}
if(reverse.equals(s))
max=s.length();
return max;
}