Leetcode 7. Reverse Integer(java版)
题目 and example:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Note:The input is assumed to be a 32-bit signed integer. Your function should return 0 when
·
题目 and example:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
题目大意:
将一个整数翻转后返回。
思路:
要注意溢出
代码:
class Solution {
public static int reverse(int x) {
int rev = 0;
while(x!=0)
{
if (rev != 0 && Integer.MAX_VALUE / rev < 10
&& Integer.MAX_VALUE / rev > -10)
return 0;
rev = rev * 10 + x % 10;
x = x / 10;
}
return rev;
}
}
开放原子开发者工作坊旨在鼓励更多人参与开源活动,与志同道合的开发者们相互交流开发经验、分享开发心得、获取前沿技术趋势。工作坊有多种形式的开发者活动,如meetup、训练营等,主打技术交流,干货满满,真诚地邀请各位开发者共同参与!
更多推荐
已为社区贡献4条内容
所有评论(0)