LeetCode 学习记录 7. Reverse Integer

1 题目要求：

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.

2 解决方法:

没什么好说的，需要注意判断溢出。

static const void* ___ = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();
class Solution {
public:
	int reverse(int x) {
		int res = 0,temp = 0;
		while (x) {
			temp = res * 10;
			if (res != temp / 10) return 0;
			res = temp + x % 10;
			if (temp != res - x % 10) return 0;
			x /= 10;
		}
		return (res);
	}
};

时间复杂度O(log(x))

空间复杂度O(1)