为学日益 为道日损

最长回文串是一个很好玩的话题，给出一个无序的不定长的字符序列，如何知道里面的最长回文串呢？manacher算法的思想是把偶数、奇数长的字符序列变成奇数长度创建一个与字符串等长的数组，用来记录字符序列相应位置上字符的最长回文半径，半径为1时默认为字符本身。然后以每个字符为中轴遍历字符序列，之后求数组的最大值即为最大的半径，即为最长的回文半径。最长回文串便迎刃而解了。packa

public String longestPalindrome(String s) { int start = 0, end = 0; for (int i = 0; i < s.length(); i++) { int len1 = expandAroundCenter(s, i, i); int len2 = expandAroundCenter

问题描述The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L

Description：Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the a