Leetcode逆整数-解決とビデオ説明



解決策
int reverse(int x) {
  int reversed = 0;
  int max = INT_MAX/10;

  while (x != 0) {

    if (abs(reversed) > max) {
      return 0;
    }

    reversed *= 10;
    reversed += (x % 10);
    x /= 10;
  }

  return reversed;
}

複雑さ
実行時: o ( n )
space : o ( n )