Leetcode 9. Palindrome Number (Java)

最新推荐文章于 2024-10-11 17:28:47 发布

内心的脊梁

最新推荐文章于 2024-10-11 17:28:47 发布

阅读量97

点赞数

本文链接：https://blog.csdn.net/weixin_58080442/article/details/123607225

版权

回文整数判断算法编程

关键词由CSDN通过智能技术生成

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward.

For example, 121 is a palindrome while 123 is not.

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

class Solution {
    public boolean isPalindrome(int x) {
       
    int palin = 0; 
    int rem = 0;
    int temp = x;
    if(x<0)
    {
    	return false;
    }
    while(x>0)
    {
    	rem = x%10;
    	palin = (palin*10) + rem;
    	x = x/10;
    }
    if(temp == palin)
    {
    	return true;
    }
    else
    {
    	return false;
    }

    }
}