[leetcode] 125 유효한 팰린드롬(Valid Palindrome)

https://leetcode.com/problems/valid-palindrome/

Valid Palindrome - LeetCode

 

---

Python

class Solution(object):
    def isPalindrome(self, s):
        """
        :type s: str
        :rtype: bool
        """
        
        strs = []
        for char in s:
            if char.isalnum():
                strs.append(char.lower())
        
        while len(strs) > 1:
            if strs.pop(0) != strs.pop():
                return False
        
        return True

---

Typescript

 

function isPalindrome(s: string): boolean {
    const formatted = s.toLowerCase().replace(/[^a-z0-9]/g, "");
    const reversed = [...formatted].reverse().join("");
    
    return formatted === reversed;
};