-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathSumOfNumberAndItsReverse.java
49 lines (47 loc) · 1.16 KB
/
SumOfNumberAndItsReverse.java
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
/*https://leetcode.com/problems/sum-of-number-and-its-reverse/*/
class Solution {
public boolean sumOfNumberAndReverse(int num) {
if (num == 1) return false;
if (num == 2) return true;
if (num == 3) return false;
double half = (double)num/2;
int l = 0, r = 0;
if (num%2 == 0)
{
if (num <= 18) return true;
int copy = (int)half;
int rev = 0;
while (copy > 0)
{
rev = (rev*10)+(copy%10);
copy /= 10;
}
if (rev == num) return true;
l = (int)half-1;
r = (int)half+1;
}
else
{
l = (int)(half-0.5);
r = (int)(half+0.5);
}
int ls = 1, re = num-1;
while (l >= ls && r <= re)
{
// System.out.println(l+" "+r);
if (reverse(r) == l) return true;
--l; ++r;
}
return false;
}
private int reverse(int num)
{
int rev = 0;
while (num > 0)
{
rev = rev*10+(num%10);
num /= 10;
}
return rev;
}
}