#Leetcode# 9. Palindrome Number

https://leetcode.com/problems/palindrome-number/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.

代码（JAVA）：

class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0) return false;
        int y = 0;
        int c = x;
        while(c != 0) {
            int t = c % 10;
            y = y * 10 + t;
            c = c / 10;
        }
        return x == y;
    }
}

代码：

class Solution {
public:
    bool isPalindrome(int x) {
        if(x < 0) return false;
        else {
          int ans = x;
          int num = 0;
          while(x > 0) {
              num = num * 10 + x % 10;
              x /= 10;
          }   
            if(num == ans) return true;
        }
    return false;
    }
};

　　

转载于:https://www.cnblogs.com/zlrrrr/p/9898491.html