LeetCode(9)——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.

AC:

class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
        	return false;
        }
        
        LinkedList<Integer> result = new LinkedList<>();
        while (x > 0) {
        	result.add(x % 10);
        	x = x / 10;
        }
        Integer[] tmp = new Integer[result.size()];
        result.toArray(tmp);
        
        for (int i = 0, j = tmp.length - 1; i < j; i++, j--) {
        	if (tmp[i] != tmp[j]) {
        		return false;
        	}
        }
        
        return true;
    }
}

猜你喜欢

转载自blog.csdn.net/weixin_39120845/article/details/80645259