摘要：
``` public class Solution { public int reverse(int x) { long rev=0; while(x!=0){ rev = rev 10+x%10; x=x/10; if(rev Integer.MAX_VALUE || rev 阅读全文
摘要：
``` public class Solution { public String convert(String s, int nRows) { if (s == null || s.isEmpty() || s.length() 0 && interval 阅读全文
摘要：
``` public String longestPalindrome(String s) { int start = 0, end = 0; for (int i = 0; i end start) { start = i (len 1) / 2; end = i + len / 2; } } r 阅读全文