java 求最长回文子串

/**
* 求最长回文子串
* 子串：连续的
* 暴力穷举
*/
public static String get01() {
String str = "googlepppe";
int length = str.length();
String finalStr = "";
for (int start = 0; start < length; start++) {
for (int end = start + 1; end <= length; end++) {
String temp = str.substring(start, end);
if (temp != null) {
if (temp.length() > finalStr.length() && isMirror(temp)) {
finalStr = temp;
}
}
}
}
Log.i("test","finalStr="+finalStr);
return finalStr;
}

public static boolean isMirror(String str){
for (int i = 0; i < str.length(); i++) {
if(str.charAt(i) != str.charAt(str.length()-i-1)){
return false;
}
}
return true;
}
}

方法比较傻，还有别的方法，待续