7.Reverse Integer
7.Reverse Integer
难度:Easy
Given a 32-bit signed integer, reverse digits of an integer.
1
Example 1:
2
3
Input: 123
4
Output: 321
5
Example 2:
6
7
Input: -123
8
Output: -321
9
Example 3:
10
11
Input: 120
12
Output: 21
13
Note:
14
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.
Copied!
talk less, show the code:
1
class Solution {
2
public:
3
int reverse(int x) {
4
string s=to_string(x);
5
int flag=(s[0]=='-');
6
long int res=0;
7
for(int i=s.length()-1;i>=flag;i--)
8
res= res*10 + int(s[i]-'0');
9
return res>INT_MAX ? 0 : (flag? -res: res);
10
11
}
12
};
Copied!
执行用时 :4 ms, 在所有 C++ 提交中击败了87.79%的用户 内存消耗 :8.3 MB, 在所有 C++ 提交中击败了77.33%的用户
Copy link