LeetCode9-Palindrome Number(C++)

Description

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?

AC代码

class Solution {
public:
    bool isPalindrome(int x) {
        if(x < 0) return false;
        int y = 0, z = x;
        short int n=0;
        while(z != 0) {
            n = z % 10;
            // 这一步是因为要确保 y*10 +n < INT_MAX
            if(y > ((INT_MAX - n)/10)) return f