求最长反序子串的java程序

给定一个字符串X，求它最长子串S，使得S=SR，SR为S的反序，即如果S=abc，则SR=cba
例子：X=abccbaa，则输出S=abccba

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class StringTest1 {
 public static void main(String[] args) {
  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  System.out.println("请输入一个字符串，我会打印出所有子串：");
  String str = null;
  try {
   str = br.readLine();
  } catch (Exception e) {
  }
  printAllSubstrings(str);
 }

 private static String printAllSubstrings(String str) {
  System.out.println("");
  int len1 = str.length();
  int len2=0;
  String sa=null;
  for (int i = len1; i >= 1; i--) {
   for (int j = 0; j < len1 - i + 1; j++) {
    String sub = str.substring(j, j + i);
    String subR = new StringBuffer(sub).reverse().toString();
    if (sub.equals(subR)) {
     System.out.println(sub);
    if(sub.length()>len2){
    len2=sub.length();
    sa=sub;
     }
    return sub;
    }
   }
  }
  return "";
 }
}