my raw answers for 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.

 

 

code:

class Solution {

public:

    bool isPalindrome(int x) {

        string a = to_string(x);

        string b = a;

        reverse(b.begin(),b.end());

        if (b==a) return true;

        else return false;

    }

};

comment:

24 ms

8.2 MB

Cpp

 

 

Solution 2: math

code:

class Solution {

public:

    bool isPalindrome(int x) {

        if(x<0||(x!=0&&x%10==0)) return false;

        int a = x;

 

        int rev = 0;

        while(a>0)

        {

            if(rev>INT_MAX/10||rev==INT_MAX&&a%10>7) return false;

            rev = rev*10 + a%10;

            a /= 10;

        }

        if (rev == x) return true;

        else return false; 

    }

};

comment:

24 ms

8 MB

Cpp

 

 

Solution 3: math, and using symmetry

code:

class Solution {

public:

    bool isPalindrome(int x) {

        if(x<0||(x!=0&&x%10==0)) return false;

        int a = x;

 

        int rev = 0;

        while(a>rev)

        {

            rev = rev*10 + a%10;

            a /= 10;

        }

        if (rev == a||rev/10 == a) return true;

        else return false; 

    }

};

 

comment:

16 ms

7.9 MB

Cpp