Palindrome Number

class Solution {
public:
    bool isPalindrome(int x) {
        if (x < 0) {
            return false;
        }
        int n = len_of_integer(x);
        int left = n;
        int right = 1;
        while (left > right) {
            int l_num = get_num_of_position(x, left);
            int r_num = get_num_of_position(x, right);
            if (l_num == r_num) {
                left--;
                right++;
            } else {
                return false;
            }
        }
        return true;
    }
    int len_of_integer(int x) {
        int n = 0;
        while (x) {
            x = x / 10;
            n++;
        }
        return n;
    }

    int get_num_of_position(int x, int p) {
        int m = pow(10, p);
        int n = pow(10, p - 1);
        int y = x % m;
        return y / n;
    }
};