class Solution {
public int reverse(int x) {
int ans=0;
while(x!=0){
int n=ans;
ans=10*ans+x%10;
if(n!=(ans-x%10)/10) return 0;
x/=10;
}
return ans;
}
}
leetcode 7 Reverse Integer
最新推荐文章于 2024-10-16 10:13:45 发布