g0001_0100.s0009_palindrome_number.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0001_0100.s0009_palindrome_number;
// #Easy #Math #Udemy_Integers #2024_01_04_Time_5_ms_(77.91%)_Space_44.1_MB_(13.06%)
public class Solution {
public boolean isPalindrome(int x) {
if (x < 0) {
return false;
}
int rev = 0;
int localX = x;
while (localX > 0) {
rev *= 10;
rev += localX % 10;
localX /= 10;
}
return rev == x;
}
}