leetcode 9. Palindrome Number

标签：read   war   from   return   term   ring   input   nbsp   amp   

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?

解法一：把翻转过的数计算出来（我的方法）

解法二：只翻转一半

public boolean isPalindrome(int x) {
    if (x<0 || (x!=0 && x%10==0)) return false;
    int rev = 0;
    while (x>rev){
        rev = rev*10 + x%10;
        x = x/10;
    }
    return (x==rev || x==rev/10);
}

leetcode 9. Palindrome Number

标签：read   war   from   return   term   ring   input   nbsp   amp   

原文地址：https://www.cnblogs.com/jamieliu/p/10306332.html