一、题目地址
https://leetcode-cn.com/problems/reverse-integer/
二、具体代码
/**
* @param {number} x
* @return {number}
*/
// 时间复杂度: O(N)
// 空间复杂度: O(1)
var reverse = function(x) {
let res = 0;
while(x !== 0) {
let tempNum = x % 10;
if(res > 214748364 || (res === 214748364 && tempNum > 7)) {
return 0;
}
if(res < -214748364 || (res === -214748364 && tempNum < -8)) {
return 0;
}
res = res * 10 + tempNum;
x = Math.trunc(x / 10);
}
return res;
};