UmdCoding的博客

Determine whether an integer is a palindrome. Do this without extra space.判断一个int数是否是回文？ 解法：转换为字符串， 字符串判断回文很简单for (int i = 0, j = s.size() - 1; i != s.size() / 2; i++, j--){ if (s[i] != s[j]) re

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 palindromic substring.分析：求最长的回文子串，时间赋值度n平方；aaa