-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path整数反转.cpp
60 lines (49 loc) · 953 Bytes
/
整数反转.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <utility>
#include <queue>
#include <stack>
using namespace std;
class Solution {
public:
int reverse(int x) {
bool flag = (x >= 0) ? true : false;
int res = 0;
while (x != 0)
{
int tmp = x % 10;
if ((flag && (res>(INT_MAX - tmp) / 10)) || (!flag && (res<(INT_MIN - tmp) / 10)))
return 0;
res = res * 10 + tmp;
x /= 10;
}
return res;
}
// update 2019.9.18
int reverse2(int x)
{
int res = 0;
bool positive = (x >= 0) ? true : false;
while (x != 0)
{
if (positive && (res > INT_MAX / 10 || res * 10 > INT_MAX - x % 10))
return 0;
if (!positive && (res < INT_MIN / 10 || res * 10 < INT_MIN - x % 10))
return 0;
res = res * 10 + x % 10;
x /= 10;
}
return res;
}
};
int main()
{
Solution a;
cout << a.reverse(INT_MAX) << endl;
system("pause");
return 0;
}