Reverse Integer

 计算int最大值:

const intmax=(unsigned int)(~0)>>1;

 

移位操作符:<<,>>

对于无符号来说:补0,左移右边补零,右移左边补0;

对于有符号来说:补0,左移右边0,右移左边补补最高有效位;

Reverse digitsof an integer.

Example1: x = 123, return 321

Example2: x = -123, return -321

click to show spoilers.

Have you thought about this?

Here are some good questions to ask before coding. Bonus pointsfor you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie,cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assumethe input is a 32-bit integer, then the reverse of 1000000003 overflows. Howshould you handle such cases?

Throw an exception? Good, but what if throwing an exception isnot an option? You would then have to re-design the function (ie, add an extraparameter). 

classSolution {
public:
    int reverse(int x) {
        int num = 0;
        const int max=(unsignedint)(~0)>>1;
        int flag=1;
        if (x<0){
            flag = -1;
            x=-x;
        }
        while (x/10) {
            num = num*10 +x%10;
            x /= 10;
        }
        if (num>max/10 || (num==max/10&& flag==1 && x>7)
                   || (num==max/10 &&flag==-1 && x>8) ){
            flags = 1;
            return 0;
         }
         return num*10*flag+x*flag;
       
    }
public:
  static int flags;
};
intSolution::flags = 0;