【LeetCode】009. Palindrome Number

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

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.

题解：

　　easy题

Solution 1

 class Solution {

 public:

     bool isPalindrome(int x) {

         if (x < )

             return false;

         int base = ;

         int tmp = x;

         while (tmp > ) {

             tmp /= ;

             base *= ;

         }

         while (x) {

             int head = x / base;

             int tail = x % ;

             if (head != tail)

                 return false;

             x = (x % base) / ;

             base /= ;

         }

         return true;

     }

 };

Solution 2

 class Solution {

 public:

     bool isPalindrome(int x) {

         if (x < )

             return false;

         int base = ;

         while (x / base > ) {

             base *= ;

         }

         while (x) {

             int head = x / base;

             int tail = x % ;

             if (head != tail)

                 return false;

             x = (x % base) / ;

             base /= ;

         }

         return true;

     }

 };

巴特西

【LeetCode】009. Palindrome Number

最新文章

热门文章