leetcode -- 647. Palindromic Substrings

题目描述：

给定一个字符串，判断字符串的子串中的回文串个数

Example 1:
Input: "abc"
Output: 3
Explanation: Three palindromic strings: "a", "b", "c".
 

Example 2:
Input: "aaa"
Output: 6
Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".

题目很简单，但是在第一次提交的时候超时，后来发现另外一种方法更好

判断字符串是否是回文串，注释部分的复杂度为O(n)，提交时TLE

改进后Accepted.

def isPalindromic(self, s, start, end):
        """if start == end:
            return True
        else:
            while start <= end:
                if s[start] == s[end]:
                    start += 1
                    end -= 1
                else:
                    return False
            return True"""
        if s[start:end+1] == s[start:end+1][::-1]:
            return True
        else:
            return False