def isPalindrome(self, s):
        for i in xrange(len(s) / 2):
            if s[i] != s[-(i + 1)]:
                return False
        return True
dataset/ETHPy150Open kamyu104/LeetCode/Python/palindrome-partitioning.py/Solution2.isPalindrome/original