LeetCode算法入门- Palindrome Number-day2

最新推荐文章于 2023-12-25 13:36:27 发布

一行代码的自述

最新推荐文章于 2023-12-25 13:36:27 发布

阅读量206

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/weixin_37766296/article/details/87995146

版权

LeetCode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

LeetCode算法入门- Palindrome Number-day2

Palindrome Number

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

Example 1:

Input: 121
Output: true

Example 2:

Input: -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: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

方法一：
将int类型x进行反转，如果反转之后和之前的数字一样，说明是回文，否则不是（记得排除负数的）

class Solution {
    public boolean isPalindrome(int x) {
      if(x < 0) 
          return false;
          
//这里是将int类型X进行反转
        int reverse = 0;
        int old = x;
        while(x != 0){
            reverse = reverse * 10 + x % 10;
            x = x / 10;
        }
        return reverse == old;
    }
}