LeetCode - 7 Reverse Integer
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode - 7 Reverse Integer相关的知识,希望对你有一定的参考价值。
题目:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
If the integer‘s last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
reversed = x%10 + reversed * 10;
public class Solution {
public int reverse(int x) {
int reversed = 0;
while (x != 0) {
int test = x % 10 + reversed * 10;
x = x / 10;
if (test/10 != reversed) {
reversed = 0;
break;
} // 此处处理overflow问题
reversed = test;
}
return reversed;
}
}
以上是关于LeetCode - 7 Reverse Integer的主要内容,如果未能解决你的问题,请参考以下文章