回文数字判断Palindrome Number

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?

直接对整数进行操作，我们可以利用取整和取余来获得我们想要的数字，比如 1221 这个数字，如果 计算 1221 / 1000， 则可得首位1， 如果 1221 % 10， 则可得到末尾1，进行比较，然后把中间的22取出继续比较。

#include<iostream>
using namespace std;

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0) return false;
       	int div=1;
       	while(x/div>=10) div*=10;  //div是和x相同位数的，比如x是156，则div是100
       	while(x>0){
       		int left=x/div;
       		int right=x%10;
       		if(left!=right) return false;
       		x=(x%div)/10;   //好好理解这句话，去掉数字x的左右头尾
       		div/=100;
       	}
       	return true;
    }
};

int main(){
	Solution S;
	cout << S.isPalindrome(1331);
	return 0;
}

参考网址：http://www.cnblogs.com/grandyang/p/4125510.html
https://leetcode.com/problems/palindrome-number/