반응형
class Solution {
fun isChar(c:Char):Boolean {
return c.isLetter() || c.isDigit()
}
fun isPalindrome(s1: String): Boolean {
var s = 0
var e = s1.length - 1
var str = s1.lowercase()
while(s<e) {
while(!isChar(str[s])) {
if(s+1>e) return true
s++
}
while(!isChar(str[e])) {
if(e-1<s) return true
e--
}
if(str[s]!=str[e]) return false
s++
e--
}
return true
}
}
반응형
'Computer > Algorithm' 카테고리의 다른 글
[LeetCode] 350. Intersection of Two Arrays II - kotlin (0) | 2025.03.03 |
---|---|
[LeetCode] 234. Palindrome Linked List - kotlin (0) | 2025.03.02 |
[LeetCode] 191. Number of 1 Bits - Kotlin (0) | 2025.03.02 |
[LeetCode] 190. Reverse Bits - Kotlin (0) | 2025.03.02 |
백준 9184 (0) | 2022.11.27 |
댓글