class Solution {
public:
int reverse(int x) {
long long res = 0;
while(x) {
res = res*10 + x%10;
x /= 10;
}
return (res<INT_MIN||res>INT_MAX) ? 0 : res;
}
};
leetcode7
最新推荐文章于 2023-09-02 14:34:05 发布