LeetCode 7. Reverse Integer

Given a 32-bit signed integer, reverse digits of an integer.

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

public class ReverseIntegerSolution {
    public int reverse(int x) {
        long result = 0;//防止翻转之后溢出

        int[] temp = new int[10];

        int i = 0;
        while (x != 0) {
            temp[i++] = x % 10;
            x /= 10;
        }

        for (int t = 0; t < i; t++) {
            result = result * 10 + temp[t];

        }

        if (result > Integer.MAX_VALUE | result < Integer.MIN_VALUE) {
            return 0;
        }
        return (int) result;

    }

}