题目:
题解:
- 暴力截取所有子串
- 利用双指针判断子串是否为回文串
- 获取最大长度回文串
public int interceptPassword(String password) {
int maxLength = -100;
for (int i = 0; i < password.length();i++) {
for (int j = i+1; j <= password.length();j++) {
if (isValid(password.substring(i, j))) {
maxLength = Math.max(maxLength, (j-i));
}
}
}
return maxLength;
}
public boolean isValid(String s) {
char[] chars = s.toCharArray();
for (int i = 0, j = s.length() - 1; i < chars.length; i++, j--) {
if (chars[i] != chars[j]) {
return false;
}
}
return true;
}
时间复杂度:O()