Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.

一个 5 位数，判断它是不是回文数。即 12321 是回文数 ，个位与万位相同，十位与千位相同。

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

# 输入输出——简单的回文判断# 代码'''可以通过使用 seq[a:b] 来从位置 a 开始到位置 b 结束来对序列进行切片 。我们同样可以提供第三个参数来确定切片的步长（Step）。默认的步长为 1 ，它会返回一份连续...

1005. Prime Palindromes Time Limit: 1sec Memory Limit:256MB

judge() 判断数字是否为回文数时，用到了数位截取，和 2021 年蓝桥杯省赛 C++ 组 B 题有类似思想，详情参考

Determine whether an integer is a palindrome. Do this without extra space.

Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by per...

Given a singly linked list, determine if it is a palindrome.

Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] ...