Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Pan...
分类:
其他好文 时间:
2015-01-05 07:02:29
阅读次数:
229
A string is a palindrome if it has exactly the same sequence of characters when traversed left-to-right as right-to-left. For example, the following s...
分类:
其他好文 时间:
2015-01-04 06:23:36
阅读次数:
230
这题算是简单,但是还是有错到我都不知道为啥错要启动编译器来调试的时候,原来是不知道有个判断字母的函数是isalnum(),于是自己写了个判断字母的函数,第一次没判断数字,就错了,第二次发现发现判断字母时我是判断A~z则是字母,但是A和a之间隔了32个字符,而大写字母只有26个,说明之间还有不是字母的...
分类:
其他好文 时间:
2015-01-03 19:49:56
阅读次数:
190
https://oj.leetcode.com/problems/palindrome-number/http://fisherlei.blogspot.com/2012/12/leetcode-palindrome-number.htmlpublicclassSolution{
publicbooleanisPalindrome(intx){
//Assume
//Negativenumberscannotbepalindrome
if(x<0)
returnfalse;
//Noextrasp..
分类:
其他好文 时间:
2015-01-02 16:14:01
阅读次数:
116
不知不觉居然已经写了200多篇随笔了,现在查找的时候经常要翻好久,很不方便。故给自己做个目录~Leetcode1、动态规划Palindrome Partitioning II(hard) ☆Distinct Subsequences(hard)Edit Distance (hard)Interlea...
分类:
其他好文 时间:
2015-01-02 14:32:34
阅读次数:
183
Palindrome Partitioning IIGiven a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a p...
分类:
其他好文 时间:
2015-01-01 16:00:58
阅读次数:
164
Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a pla...
分类:
其他好文 时间:
2014-12-30 20:39:15
阅读次数:
156
LeetCode: Palindrome 回文相关题目汇总LeetCode: Palindrome Partitioning 解题报告LeetCode: Palindrome Partitioning II 解题报告Leetcode:【DP】Longest Palindromic Substring...
分类:
其他好文 时间:
2014-12-30 20:37:58
阅读次数:
149
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs...
分类:
其他好文 时间:
2014-12-30 16:38:28
阅读次数:
194
The questions:Determine whether an integer is a palindrome. Do this without extra space.Analysis:To determine whether an integer is a palindrome, we c...
分类:
其他好文 时间:
2014-12-30 01:41:54
阅读次数:
208