class Solution {
public:
bool isPalindrome(int x) {
if(x<0)return false;
vector<int>num;
do{
num.push_back(x%10);
x/=10;
}while(x);
for(int i=0;i<num.size()/2;i++)
{
if(num[i]!=num[num.size()-1-i])return false;
}
return true;
}
};
Runtime: 8 ms, faster than 46.98% of Rust online submissi...
https://leetcode.com/problems/palindrome-number/[https://...
https://leetcode.com/problems/palindrome-number/descripti...
https://leetcode.com/problems/palindrome-number/#/descrip...
https://leetcode.com/problems/palindrome-number/descripti...
https://leetcode.com/problems/palindrome-number/discuss/判...
链接：https://leetcode.com/problems/palindrome-number/#/desc...
题目来源：https://leetcode-cn.com/problems/palindrome-number/ ...
题目 https://leetcode-cn.com/problems/palindrome-number/ 判断...
本文标题：palindrome-number
本文链接：https://www.haomeiwen.com/subject/cacnlctx.html
网友评论