Palindrome Number leetcode

来源:互联网 发布:双翼软件官网 编辑:程序博客网 时间:2024/05/29 04:46

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

Some hints:

Could negative integers be palindromes? (ie, -1)

If you are thinking of converting the integer to string, note the restriction of using extra space.

You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know that the reversed integer might overflow. How would you handle such case?

There is a more generic way of solving this problem.

Subscribe to see which companies asked this question

package com.alibaba;import java.util.Scanner;public class Solution{public boolean isPalindrome(int x){int max = x;int min = 0;while(max > 0){min *= 10;min += max % 10;max /= 10;}return x == min;}public static void main(String[] args){Solution sol = new Solution();Scanner in = new Scanner(System.in);int num = in.nextInt();in.close();boolean result = sol.isPalindrome(num);System.out.println("result:" + result);}}


0 0