0009 - Palindrome Number (Easy)

Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.

Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

class Solution:
    def isPalindrome(self, x: int) -> bool:
        #str: convert to string
        #[::-1]: read from the end
        return str(x) == str(x)[::-1]

class Solution {
    public boolean isPalindrome(int x) {
        String str = Integer.toString(x);
        StringBuilder rev = new StringBuilder(str).reverse();
        return rev.toString().equals(str);
    }
}

/**
 * @param {number} x
 * @return {boolean}
 */
var isPalindrome = function (x) {
  var str = x.toString();
  return str.split('').reverse().join('') == x.toString();
};

class Solution {
public:
    bool isPalindrome(int x) {
        string strX = to_string(x);
        reverse(strX.begin(), strX.end());
        return to_string(x) == strX;
    }
};

class Solution:
    def isPalindrome(self, x: int) -> bool:
        in_num = x
        reverser = 0
        while in_num > 0:
            reverser = reverser * 10 + checker % 10
            in_num = in_num//10
        return reverser == x

class Solution {
    public boolean isPalindrome(int x) {
        if (x < 0) {
            return false;
        } else {
            int result = 0;
            int n = x;
            while (n > 0) {
                int r = n % 10;
                result = result * 10 + r;
                n /= 10;
            }
            return result == x;
        }
    }
}

var isPalindrome = function (x) {
  if (x < 0 || (x > 0 && Object.is(x % 10, 0))) return false;
  let n = x;
  let num = 0;
  while (x > 0) {
    num = num * 10 + (x % 10);
    x = Math.floor(x / 10);
  }
  return Object.is(n, num);
};

class Solution {
public:
    bool isPalindrome(int x) {
        long int res = 0, carry, n = x;
        if (x < 0) {
            return false;
        } else {
            while (n > 0) {
                carry = n % 10;
                res = res * 10 + carry;
                n /= 10;
            }
        }
        return res == x;
    }
};