题目: ac代码: bool isPalindrome(int x){ int num[11]; int index = -1; if(x<0) return false; while(x!=0){ index ++; num[index] = x%10; x = x/10; } for(int i = 0;i<=index;i++) if(num[i] != num[index - i]) return false; return true; }