leetcode-0007-Reverse Integer（反转整数）

题目

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

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

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.

解题

思路：取模，然后模数*10，不断累加，判断int是否越界

  public static int reverse(int x) {
    int result = 0;
    while (x != 0) {
      int remainder = x % 10;
      int newResult = result * 10 + remainder;

      // to check newResult is overflow or not
      if ((newResult - remainder) / 10 != result) {
        return 0;
      }
      result = newResult;
      x = x / 10;
    }
    return result;
  }

  public static int reverse2(int x) {
    long result = 0;
    while (x != 0) {
      result = result * 10 + x % 10;
      // to check newResult is overflow or not
      if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) {
        return 0;
      }
      x = x / 10;
    }
    return (int) result;
  }