Skip to content

Commit ed2bdc1

Browse files
authored
Update 0005-longest-palindromic-substring.kt
Code cleanup
1 parent 7012164 commit ed2bdc1

File tree

1 file changed

+8
-13
lines changed

1 file changed

+8
-13
lines changed

Diff for: kotlin/0005-longest-palindromic-substring.kt

+8-13
Original file line numberDiff line numberDiff line change
@@ -1,37 +1,32 @@
11
class Solution {
22
fun longestPalindrome(s: String): String {
3-
4-
var start = 0 // start of longest palindrom
3+
var start = 0
54
var maxL = 0
65

7-
for(i in 0 until s.length){
8-
9-
//odd length palindrom
6+
for (i in 0 until s.length) {
107
var l = i
118
var r = i
12-
while(l >= 0 && r < s.length && s[l] == s[r]){
13-
if(r - l + 1 > maxL) {//index to size +1
9+
while (l >= 0 && r < s.length && s[l] == s[r]) {
10+
if (r - l + 1 > maxL) {
1411
start = l
1512
maxL = (r - l + 1)
1613
}
1714
l--
1815
r++
1916
}
2017

21-
//even length palindrom
2218
l = i
2319
r = i + 1
24-
while(l >= 0 && r < s.length && s[l] == s[r]){
25-
if(r - l + 1 > maxL) {//index to size +1
20+
while (l >= 0 && r < s.length && s[l] == s[r]) {
21+
if (r - l + 1 > maxL) {
2622
start = l
2723
maxL = (r - l + 1)
2824
}
2925
l--
3026
r++
31-
}
32-
27+
}
3328
}
3429

35-
return s.substring(start, start+maxL)
30+
return s.substring(start, start + maxL)
3631
}
3732
}

0 commit comments

Comments
 (0)