Skip to content

Create 0268_Week 08(java)2 #1341

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ctianjin wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create 0268_Week 08(java)2 #1341

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions Week_08/G20190343020268/0268_Week 08(java)2
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
//5. 最长回文子串
class Solution {
public int sub(String s, int left, int right){
while(left >= 0 && right < s.length() && s.charAt(left) == s.charAt(right)){
left--;
right++;
}
int length = right - left - 1;
return length;
}

public String longestPalindrome(String s) {
int len = s.length();
if(len <= 1) return s;
int max = 0;
String ret = null;
for(int i = 0; i < len; i++){
int m = sub(s, i, i);
int n = sub(s, i, i + 1);
int length = Math.max(m, n);
if(length > max){
int L = i - (length - 1) / 2;
int R = i + length / 2;
max = length;
ret = s.substring(L, R + 1);
}
}
return ret;
}
}