-
Notifications
You must be signed in to change notification settings - Fork 0
/
polindrome.c
59 lines (52 loc) · 1.01 KB
/
polindrome.c
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
#include "polindrome.h"
/*
* Given an integer x, return true if x is a
* palindrome
* , and false otherwise.
*
*
*
* Example 1:
*
* Input: x = 121
* Output: true
* Explanation: 121 reads as 121 from left to right and from right to left.
* Example 2:
*
* Input: x = -121
* Output: false
* Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
* Example 3:
*
* Input: x = 10
* Output: false
* Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
*
*
* Constraints:
*
* -231 <= x <= 231 - 1
*
*
* Follow up: Could you solve it without converting the integer to a string?
*/
bool isPalindrome(int x)
{
if (x < 0)
{
return false;
}
bool res = true;
long high = 1;
while (x >= high)
high *= 10;
high /= 10;
while (res && x > 0 && high >= 10)
{
res = (x / high == x % 10);
x %= high;
x /= 10;
high /= 100;
}
return res;
}