Leetcode7 : Reverse Integer 整数反转问题

2024-08-25 07:39:20

问题描述

Example1: x = 123, return 321

Example2: x = -123, return -321

原题链接: https://leetcode.com/problems/reverse-integer/

解决方案

 public int reverse(int x) {

        long res = 0; //need to consider the overflow problem

        while(x != 0){

            res = res * 10 + x % 10; // -11%10 = -1

            if(res > Integer.MAX_VALUE || res < Integer.MIN_VALUE){

                return 0;

            }

            x = x/10;

        }

        return (int)res;

    }

最新文章

热门文章