Leetcode -- Palindrome Number

Solution 03/30/2014:

class Solution {  
 public:  
   bool isPalindrome(int x) {  
     if(x < 0) {  
       return false;  
     }  
     int number = x;  
     int digits = 0;  
     while (number) {  
       digits++;  
       number /= 10;  
     }  
     for(int i = 0; i < digits / 2; i++) {  
       int right = x % 10;  
       int raise = digits - i - 1;  
       int left = x / std::pow(10, raise);  
       if(right != left) {  
         return false;  
       }  
       x = x % raise;  
       x /= 10;  
     }  
     return true;  
   }  
 };