[LeetCode] 7. Reverse Integer

最新推荐文章于 2022-06-06 18:52:41 发布

转载最新推荐文章于 2022-06-06 18:52:41 发布 · 55 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/skyssky/p/5740375.html

#include <stdio.h>
#include <math.h>

// 7. Reverse Integer
// Difficulty: Easy
// Reverse digits of an integer.
// Example1: x = 123, return 321
// Example2: x = -123, return -321
// https://leetcode.com/problems/reverse-integer/

int reverse(int x) {

    // *** METHOD 2
    long y = 0;            // a trick, may be improved
    while (x) {
        y = y * 10 + x % 10;
        x /= 10;
        if (y > pow(2,31) - 1 || y < -1 * pow(2,31)) {
            printf("(2^31) - 1 = %d, -1 * (2^31) = %d, y = %ld\n", (int)pow(2,31) - 1, -1 * (int)pow(2,31), y);
            return 0;    // IMPORTANT: consider range of int
        }
    }
    return y;
}

int main() {
    int x = 1534236469;
    printf("x = %d, reversed x = %d\n", x, reverse(x));
    return 0;
}