leetcode-algorithms/python/valid_pallindrome_ii.py at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution:
    def isPalindrome(self, s: str, left: int, right: int) -> bool:
        while left < right:
            if s[left] != s[right]: return False
            left += 1
            right -= 1
        return True

    def validPalindrome(self, s: str) -> bool:
        left, right = 0, len(s) - 1
        while left < right:
            if s[left] != s[right]:
                if self.isPalindrome(s, left + 1, right): return True
                return self.isPalindrome(s, left, right - 1)
            left += 1
            right -= 1
        return True