leetcode:数学：Palindrome Number

Determine whether an integer is a palindrome. Do this without extra space.

---

class Solution {public:    bool isPalindrome(int x) {        if (x < 0) return false;        int bit[10];        int cnt = 0;        while (x) {            bit[cnt++] = x % 10;            x /= 10;        }        for (int i = 0; i < cnt; i++)            if (bit[i] != bit[cnt - i - 1])                return false;        return true;    }};