Sangmun

Palindrome 본문

알고리즘/리트코드

Palindrome

상상2 2023. 4. 27. 22:41

https://www.youtube.com/watch?v=Yjgmw3rMof4&t=3s 

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

 

Valid Palindrome - LeetCode

Can you solve this real interview question? Valid Palindrome - A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric cha

leetcode.com

class Solution:
    def isPalindrome(self, s: str) -> bool:

        tmp = ''
        for each in s:
            if each.isalnum():
                tmp += each.lower()
        
        if tmp == tmp[::-1]:
            return True
        else:
            return False

'알고리즘 > 리트코드' 카테고리의 다른 글

459. Repeated Substring Pattern  (0) 2023.08.12
283. Move Zeroes  (0) 2023.05.04
516. Longest Palindromic Subsequence  (0) 2023.04.22
662. Maximum Width of Binary Tree  (0) 2023.04.20
Leet code Validate Stack Sequences  (0) 2023.04.13
'알고리즘/리트코드' Related Articles more
Comments