博主分享免费Java教学视频，B站账号：Java刘哥
Question
Given a 32-bit signed integer, reverse digits of an integer.
Example 1:
Input: 123 Output: 321
Example 2:
Input: -123 Output: -321
Example 3:
Input: 120 Output: 21
Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
My Answer
class Solution {
public int reverse(int x) {
int y = 0;
while (x != 0) {
int temp = y * 10 + x % 10;
// 解决溢出情况，返回0
if ((temp - x % 10) / 10 != y) {
return 0;
}
y = temp;
x = x / 10;
}
return y;
}
}
- 微信
- 交流学习，有偿服务
-
- 博客/Java交流群
- 资源分享，问题解决，技术交流。群号：590480292
-
您可以选择一种方式赞助本站
支付宝扫一扫赞助
微信钱包扫描赞助
赏