We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents f0b3d19 + 60c1328 commit ffb8981Copy full SHA for ffb8981
kotlin/0005-longest-palindromic-substring.kt
@@ -0,0 +1,37 @@
1
+class Solution {
2
+ fun longestPalindrome(s: String): String {
3
+
4
+ var start = 0 // start of longest palindrom
5
+ var maxL = 0
6
7
+ for(i in 0 until s.length){
8
9
+ //odd length palindrom
10
+ var l = i
11
+ var r = i
12
+ while(l >= 0 && r < s.length && s[l] == s[r]){
13
+ if(r - l + 1 > maxL) {//index to size +1
14
+ start = l
15
+ maxL = (r - l + 1)
16
+ }
17
+ l--
18
+ r++
19
20
21
+ //even length palindrom
22
+ l = i
23
+ r = i + 1
24
25
26
27
28
29
30
31
32
33
34
35
+ return s.substring(start, start+maxL)
36
37
+}
0 commit comments