9. Palindrome Number

题目：

9. Palindrome Number

Determinewhether an integer is a palindrome. Do this without extra space。

该题比较简单代码如下

//法一class Solution1 {public:bool isPalindrome(int x) {if (x<0 || (x != 0 && x % 10 == 0)) return false;int sum = 0, origin = x;while (x){sum = sum * 10 + x % 10;x = x / 10;}return origin == sum ? 1 : 0;}};//法二class Solution {public:bool isPalindrome(int x) {if (x<0 || (x != 0 && x % 10 == 0)) return false;int sum = 0;while (x>sum){sum = sum * 10 + x % 10;x = x / 10;}return (x == sum) || (x == sum / 10);}};