1 题目要求:
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.
2 解决方法:
static int x=[](){
std::ios::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}();
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0) return false;
int reverse = 0, reg = x;
while (reg)
{
reverse = 10 * reverse + reg % 10;
reg /= 10;
}
return reverse == x;
}
};
时间复杂度O(log(x))
空间复杂度O(1)