同步发于 JuzerTech 网站,里面有我软、硬件学习的纪录与科技产品开箱,欢迎进去观看。
题目为给定一个整数 ( INT ) ,反转此整数 ( INT )。
题目与范例如下
Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.
Assume the environment does not allow you to store 64-bit integers (signed or unsigned).
Example 1:
Input: x = 123
Output: 321
Example 2:
Input: x = -123
Output: -321
Example 3:
Input: x = 120
Output: 21
Example 4:
Input: x = 0
Output: 0
Constraints:
-231 <= x <= 231 - 1
我的解题策略为,每次从 x 取出最后一位数加到 total ( 先对 total x 10 进位 ) ,在加之前都先判别是否溢位。这边有个小技巧 if ( total * 10 < INT_MAX ) 要写成 if ( total < INT_MAX/10 ) ,不然在判别时就会溢位了。
下方为我的代码
int reverse(int x){
int total = 0,max = INT_MAX/10,min = INT_MIN/10;
while(x != 0){
if(total<=max && total >= min){
total *= 10;
total += x%10;
x/=10;
}
else
return 0;
}
return total;
}
下方为时间与空间之消耗
Runtime: 4 ms, faster than 55.81 % of C online submissions for Reverse Integer.
Memory Usage: 5.5 MB, less than 94.79 % of C online submissions for Reverse Integer.