[LeetCode] 9. Palindrome Number

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

public class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
            return false;
        } else if (x < 10) {
            return true;
        }
        int temp = x / 10;
        int h = 10;
        while (temp >= 10) {
            temp /= 10;
            h *= 10;
        }
        while (h > 1) {
            int r = x % 10;
            int l = x / h;
            if (l != r) {
                return false;
            }
            x %= h;
            x /= 10;
            h /= 100;
        }
        return true;
    }
}