摘要： bool isPalindrome(int x) { if(x==0)return true; if(x < 0 || !(x%10))return false; int fs = 0; int ft = x; while(ft>fs){ fs*=10; fs+=ft%10; ft/=10; } r 阅读全文

摘要： char ans[10000];char* convert(char* s, int numRows) { int m_size = strlen(s); if(numRows<=1)return s; int cyc = 2 * numRows - 2; int col = m_size/numR 阅读全文

摘要： char* longestPalindrome(char* s) { int slen = strlen(s); int st = 0, ed = 0; int ans = 1; for(int i = 0 ; i < slen ; ) { int j = i ; int k = i ; while 阅读全文