Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2015-03-04 09:44:51
阅读次数：
122
最长回文子串动态规划的方法的参考Palindrome Partitioning （回文子串题）代码：class Solution {public: string longestPalindrome(string s) { int n=s.size(); int dp...
分类：
其他好文 时间：
2015-03-03 20:39:26
阅读次数：
105
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers...
分类：
其他好文 时间：
2015-03-02 19:09:13
阅读次数：
151
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers...
分类：
其他好文 时间：
2015-03-02 09:36:02
阅读次数：
111
[LeetCode] 005. Longest Palindromic Substring (Medium) (C++/Java/Python)...
分类：
编程语言 时间：
2015-02-28 00:18:42
阅读次数：
226
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number...
分类：
其他好文 时间：
2015-02-28 00:07:44
阅读次数：
192
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers...
分类：
其他好文 时间：
2015-02-25 21:11:47
阅读次数：
126
A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number...
分类：
其他好文 时间：
2015-02-21 18:51:20
阅读次数：
178
#include#includeint main(){ int n,jin; scanf("%d%d",&n,&jin); if(0==n) //特判0的时候，就是回文数 { printf("Yes\n0"); return 0; } int arr[50]...
分类：
其他好文 时间：
2015-02-19 12:51:32
阅读次数：
148
Problem Description
One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:
First step: girls will write a long string (only c...
分类：
其他好文 时间：
2015-02-18 17:40:37
阅读次数：
660
