ACM_Someone like you

bool isPalindrome(int x) {
    if (x < 0)
        return false;
    else {
        int num = x;
        char str[1000];
        sprintf(str, "%d" , num);
        int size = (int)strlen(str);
        bool isFlag = true;
        for  (int i = 0; i < size / 2; i ++) {
            if (str[i] != str[size - 1 - i]) {
                isFlag = false;
                break;
            }
        }
        return isFlag;
    }
}

bool isPalindrome(int x) {
    if (x < 0 || (x % 10 == 0 && x > 0)) //能被10 整除 大于 0的數 一定不對稱 邊界
        return false;
    else {
        int sumLong = x;
        int sum = 0;
        int num =  0;
        while (x > 0) {    
            num = x % 10;  //末尾數字
            sum = sum * 10;//進位
            sum += num;
            x = x / 10;
        }
        return sum == sumLong;
    }
}