Leetcode9) Palindrome Number

13 Apr 2021 in Algorithms

https://leetcode.com/problems/palindrome-number/

• My initial solution : not that good performance

class Solution {
    public boolean isPalindrome(int x) {
        String y = x+"";
        int s=0;
        int e=y.length()-1;
        while(s<e){
            if(y.charAt(s) ==y.charAt(e)){
                s++;e--;
            }else{
                return false;
            }
        }
        return true;
    }
}

• palindromic –> meaning if you reverse then it is going to be same! so REVERSE the first half and compare to the second half.
• I can use this technic for Number Palindromic problem.

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