19.1.20 [LeetCode 7]Reverse Integer
Easy
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.
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 class Solution { 2 public: 3 int reverse(int x) { 4 long long y = 0; 5 while (x) { 6 y *= 10; 7 y += x % 10; 8 x /= 10; 9 } 10 if (y > INT_MAX || y < INT_MIN)return 0; 11 return y; 12 } 13 };
简单翻转……只是要注意溢出情况
注定失败的战争,也要拼尽全力去打赢它;
就算输,也要输得足够漂亮。