LeetCode#7 整数反转（数学）

import java.util.Scanner;

class Solution {
    public int reverse(int x) {
        int res = 0;
        while(x != 0) {
            int temp = x%10;
            x /= 10;
            if(res > Integer.MAX_VALUE/10 || (res == Integer.MAX_VALUE/10 && temp > 7))
                return 0;
            if(res < Integer.MIN_VALUE/10 || (res == Integer.MIN_VALUE/10 && temp >8))
                return 0;
            res = res * 10 + temp;
        }
        return res;
    }
}

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
        Solution solution = new Solution();
        int ans = 0,K = 5;
        while(K > 0) {
            K--;
            ans = scan.nextInt();
            System.out.println(solution.reverse(ans));
        }
    }

}