u014652699的专栏

一. Longest Palindromic SubstringGiven a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example: Input: “babad” Output: “bab” Note: “a

一. Palindrome NumberDetermine whether an integer is a palindrome. Do this without extra space.Difficulty:EasyTIME：6MIN解法判断一个数字是否是回文，如果是字符串，当然很简单，因为知道字符串的长度，也能访问字符串的每一个字符。但是如果是数字就不太一样了，因为不能立刻得到数字的位数以及分别

一. Longest Palindromic SubsequenceYou are given two non-empty linked lists representing two non-negative Given a string s, find the longest palindromic subsequence’s length in s. You may assume that