leetcode1332

 1 class Solution:
 2     def isPalindrome(self,s):
 3         n = len(s)
 4         i,j = 0,n-1
 5         while i < j:
 6             if s[i] != s[j]:
 7                 return False
 8             i += 1
 9             j -= 1
10         return True
11 
12     def removePalindromeSub(self, s: str) -> int:
13         n = len(s)
14         if n == 0:
15             return 0
16         if self.isPalindrome(s):
17             return 1
18         else:
19             return 2