PalindromeDescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You ar...
分类:
编程语言 时间:
2014-10-29 21:07:50
阅读次数:
219
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana...
分类:
其他好文 时间:
2014-10-29 12:44:21
阅读次数:
171
Determine whether an integer is a palindrome. Do this without extra space.这题貌似解法挺多,直接用简单的把数倒置,没有考虑数据溢出的问题,如需解决可以把转置数设为long long即可。另外方法可以用到前后匹配、递归比较等。 ...
分类:
其他好文 时间:
2014-10-29 12:30:15
阅读次数:
115
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.//数字或字母For example,"A man, a plan, a cana...
分类:
其他好文 时间:
2014-10-27 20:55:25
阅读次数:
178
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (i...
分类:
其他好文 时间:
2014-10-27 19:28:33
阅读次数:
217
Given a string s, partition s such that every substring of the partition is a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = "aab",
Return
[
["aa","b"],...
分类:
其他好文 时间:
2014-10-27 15:39:02
阅读次数:
227
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类:
编程语言 时间:
2014-10-27 10:46:48
阅读次数:
230
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (i...
分类:
其他好文 时间:
2014-10-26 16:52:38
阅读次数:
148
DP、KMP什么的都太高大上了,自己想了个朴素的遍历方法。
【题目】
Given a string S,
find the longest palindromic substring in S.
You may assume that the maximum length of S is
1000, and there exists one unique longest palin...
分类:
其他好文 时间:
2014-10-26 15:37:32
阅读次数:
249
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类:
编程语言 时间:
2014-10-26 11:31:30
阅读次数:
243