LeetCode：Reverse Integer

Reverse digits of an integer.

Example1: x = 123, return 321

Example2: x = -123, return -321

// Source : https://oj.leetcode.com/problems/reverse-integer/
// Author : Chao Zeng
// Date   : 2014-12-20

class Solution {
public:
    int array[100];
    int reverse(int x) {
        if (x == 0)
            return x;
            
        bool flag = true;
        if (x < 0){
            x = -x;
            flag = false;
        }
        int k = 0;
        while (x){
            array[k++] = x % 10;
            x = x / 10;
        }
        if (k > 10 || (k == 10 && array[0] >= 3) )
            return 0;
            
        //为了保险，用了64位整数
        int64_t ans = 0;
        for (int i = 0; i < k; i++){
            ans = ans * 10 + array[i];
        }
        if (ans > 2147483647 || ans < -2147483648)
            return 0;
            
        if (!flag)
            ans = -ans;
        return ans;
    }
};