/**
* 找出最长对称字符串
*
* @author tobiasy
*/
public
class
MaxSymmetric {
public
static
void
main(String[] args) {
// TODO 输出最长对称字符串:goog
String input1 =
"google"
;
// TODO 输出最长对称字符串:aba
String input2 =
"abada"
;
// TODO 输出2个最长对称字符串:pop/upu
String input3 =
"pop-upu"
;
start(
"sdghjdgzzgdah"
);
}
/**
* 启动方法
* @param str
*/
private
static
void
start(String str) {
List<String> list = maxSubSymmetric(str);
if
(list.isEmpty()) {
System.err.println(
"没有找到对称字串!"
);
}
list.forEach(System.
out
::println);
}
/**
* 获取字符串中最长的对称字串
* @param str
* @return
*/
private
static
List<String> maxSubSymmetric(String str) {
List<String> result =
new
ArrayList<>();
List<String> list = allSubSymmetric(str);
Integer length = 0;
for
(String s : list) {
if
(s.length() > length) {
length = s.length();
}
}
for
(String s : list) {
if
(s.length() >= length) {
result.add(s);
}
}
return
result;
}
/**
* 获取所有的对称字串
* @param str
* @return
*/
private
static
List<String> allSubSymmetric(String str) {
List<String> list =
new
ArrayList<>();
for
(
int
i = 0; i <= str.length(); i++) {
for
(
int
j = i; j <= str.length(); j++) {
String sub = str.substring(i, j);
if
(check(sub)) {
list.add(sub);
}
}
}
return
list;
}
/**
* 判断字符串是否对称
* @param str
* @return
*/
private
static
boolean check(String str) {
if
(str ==
null
|| str.length() <= 1) {
return
false
;
}
for
(
int
i = 0; i < str.length(); i++) {
if
(str.charAt(i) != str.charAt(str.length() - i - 1)) {
return
false
;
}
}
return
true
;
}
}