10 examples of 'generate palindrome string python' in Python

31
@staticmethod
32
def is_palindrome(num):
33
    return str(num) == ''.join(reversed(str(num)))

21
def isPalindrome(string):
22
    leftIdx = 0
23
    rightIdx = len(string) - 1
24
    while leftIdx < rightIdx:
25
        if string[leftIdx] != string[rightIdx]:
26
            return False
27
        leftIdx += 1
28
        rightIdx -= 1
29
    return True

14
def isPalindrome(self, s):
15
    """
16
    :type s: str
17
    :rtype: bool
18
    """
19
    cleaned = re.sub('[^0-9a-zA-Z]', '', s)
20
    if cleaned.lower() == cleaned[::-1].lower():
21
        return True
22
    return False

20
def shortestPalindrome(self, s):
21
    """
22
    :type s: str
23
    :rtype: str
24
    """
25
    rStr = s[::-1]
26
    for i in range(len(s)):
27
        temp = rStr[:i] + s
28
        if self.isPalindrome(temp):
29
            return temp
30
    return ""

34
def isPalindrome(self, s: 'str') -> 'bool':
35
    s = ''.join(filter(str.isalnum, s)).lower()
36
    return s == s[::-1]

35
def isPalindrome(self, A):
36
    low, high = 0, len(A) - 1
37
    while low < high:
38
39
        while low < high and not A[low].isalnum():
40
            low += 1
41
42
        while low < high and not A[high].isalnum():
43
            high -= 1
44
45
        if A[low].lower() != A[high].lower():
46
            return 0
47
48
        low, high = low + 1, high - 1
49
50
    return 1

13
def isPalindromeIterative(string):
14
    start = 0
15
    end = len(string) - 1
16
    while start < end:
17
        start = start + 1
18
        end = end - 1
19
        if string[start] != string[end]:
20
            return False
21
    return True

36
def isPalindrome(self, x):
37
    """
38
    :type x: int
39
    :rtype: bool
40
    """
41
    if x < 0:
42
        return False
43
    x = abs(x)
44
    l = len(str(x))
45
    i = 1
46
    while i < l / 2 + 1:
47
48
        head = (x / 10 ** (l-i)) % 10
49
        tail = (x % 10 ** i) if i == 1 else (x % 10 ** i) / (10 ** (i-1))
50
        if head != tail:
51
            return False
52
        i = i + 1
53
54
    return True

18
def longestPalindrome(string):
19
    size = len(string)
20
    dp = []
21
    # 初始化一个N * N的矩阵
22
    for i in range(size):
23
        row = []
24
        for j in range(size):
25
            row.append(False)
26
        dp.append(row)
27
    max_seq_len = 0
28
    max_seq = ""
29
    for i in range(size - 1, -1, -1):
30
        for j in range(i, size):
31
            if j == i:
32
                dp[i][j] = True
33
            elif j == i + 1:
34
                if string[i] == string[j]:
35
                    dp[i][j] = True
36
                else:
37
                    dp[i][j] = False
38
            else:
39
                if string[i] == string[j] and dp[i + 1][j - 1]:
40
                    dp[i][j] = True
41
                else:
42
                    dp[i][j] = False
43
            if j - i + 1 >= max_seq_len and dp[i][j]:
44
                max_seq_len = j - i + 1
45
                max_seq = string[i:j + 1]
46
    return max_seq

8
def palindrome_index(s):
9
    for i in range(len(s)):
10
        if is_palindrome(s[i+1:len(s)-i]):
11
            return i
12
13
        if is_palindrome(s[i:len(s)-i-1]):
14
            return len(s)-i-1