LeetCode: Palindrome Number

来源：互联网发布：颜真卿书法知乎编辑：程序博客网时间：2024/04/30 05:53

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

class Solution {public:    bool isPalindrome(int x) {        if(x < 0)            return false;        if(x == 0)            return true;        int divide = 1, multi = 1;        int temp = x;        while(temp >= 10)        {            temp = temp/10;            divide *= 10;        }        while(divide >= multi)        {            int left = (x/divide) % 10;            divide /= 10;            int right = (x/multi) % 10;            multi *= 10;            if(left != right)                return false;                    }        return true;            }};

Round 3:

class Solution {public:    bool isPalindrome(int x) {        int divide = 1;        int temp = x;        if(x < 0)            return false;        while(temp > 9)        {            temp /= 10;            divide *= 10;        }        int multi = 1;        while(divide > multi)        {            int left = (x / divide) % 10;            divide /= 10;            int right = (x / multi) % 10;            multi *= 10;            if(left != right)                return false;        }        return true;    }};

0 0