-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLeetCode_0005.java
56 lines (47 loc) · 1.39 KB
/
LeetCode_0005.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package com.lijieyao.redis.entity;
/**
* @author LiJieYao
* @date 2021/4/21 22:09
* @description 力扣第五题
*/
public class LeetCode_0005 {
/*
* 给你一个字符串 s,找到 s 中最长的回文子串。
*/
public static void main(String[] args) {
System.out.println(longestPalindrome("acc"));
}
public static String longestPalindrome(String s) {
if (s.length() == 1) return s;
int ll = 0;
int rr = 0;
int len = 1;
for (int i = 0; i < s.length(); i++) {
int l = i - 1;
int r = i + 1;
while (l >= 0 && r < s.length() && s.charAt(l) == s.charAt(r)) {
int currentLen = (r - l + 1);
if (len < currentLen) {
len = currentLen;
rr = r;
ll = l;
}
r++;
l--;
}
l = i;
r = i + 1;
while (l >= 0 && r < s.length() && s.charAt(l) == s.charAt(r)) {
int currentLen = (r - l + 1);
if (len < currentLen) {
len = currentLen;
rr = r;
ll = l;
}
r++;
l--;
}
}
return s.substring(ll, rr + 1);
}
}