[LeetCode]Reverse Integer

题目描述：

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

解题方案：

该题比较简单，直接贴代码：

class Solution {
public:
    int reverse(int x) {
        //char word[15];
        int flag;
        int result = 0;
        int count = 1;
        if( x >= 0){
            flag = 1;
        }else{
            flag = -1;
            x = -x;
        }
        while(true){
            int temp = x % 10;
            //cout<<temp<<endl;
            result = result * count + temp;
            count = 10;
            x /= 10;
            //cout << x<<endl;
            if(x == 0){
                break;
            }
        }

        return flag * result;
    }
};