public class LeetCode7 { public int reverse(int x) { if (x == Integer.MIN_VALUE) { return 0; } int neg = x < 0 ? -1 : 1; x *= neg; int ret = 0; while (x > 0) { int n = ret; n = n*10; n += x%10; x/=10; if (n/10 != ret) return 0; ret = n; } return ret*neg; } public static void main(String[] args) { System.out.println(new LeetCode7().reverse(123)); } }
LeetCode7
最新推荐文章于 2024-05-02 10:05:47 发布