We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 63be5c0 commit b50b69dCopy full SHA for b50b69d
solution/0000-0099/0009.Palindrome Number/README.md
@@ -250,22 +250,20 @@ class Solution {
250
251
#### C
252
253
-```C
+```c
254
bool isPalindrome(int x) {
255
- if (x < 0)
+ if (x < 0 || (x != 0 && x % 10 == 0)) {
256
return false;
257
- int original = x;
258
- int reversed = 0;
259
- while (x != 0) {
260
- int digit = x % 10;
261
- if (reversed > (2147483647 - digit) / 10)
262
- return false;
263
- reversed = reversed * 10 + digit;
+ }
+
+ int y = 0;
+ while (y < x) {
+ y = y * 10 + x % 10;
264
x /= 10;
265
}
266
- return original == reversed;
267
-}
268
+ return (x == y || x == y / 10);
+}
269
```
270
271
<!-- tabs:end -->
0 commit comments