9. Palindrome Number

最新推荐文章于 2022-02-02 16:01:08 发布

Joy CR

最新推荐文章于 2022-02-02 16:01:08 发布

阅读量306

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/xiaoqiu_cr/article/details/104236204

版权

Leetcode 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

Palindrome Number

Easy

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.

solution

class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0)
            return false;
        ArrayList<Integer> list = new ArrayList<>();
        
        while(x > 0){
            int digit = x % 10;
            x  = x / 10;
            list.add(digit);
        }
        int size = list.size();
        
        for(int i = 0; i < size; i++){
            while(list.get(i) != list.get(size-i-1))
                return false;
        }
        return true;
    }
}