9. 回文数
public class Solution {
public bool IsPalindrome(int x) {
if (x < 0)
return false;
var y = x;
var z = 0L;
while (x != 0)
{
z *= 10;
z += x % 10;
x /= 10;
}
return y == z;
}
}