Reverse Integer

xansus

于 2014-04-30 12:25:18 发布

阅读量269

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/xansus/article/details/24768243

版权

LeetCode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

class Solution {
public:
    int reverse(int x) {
        int result = 0;
        int flag = false;
        if(x < 0)
        {
            flag = true;
            x = -x;
        }
        while(x > 9)
        {
            int y = x % 10;
            x = x / 10;
            result = result * 10 + y;
        }
        result = result * 10 + x;
        if(flag == true)
        {
            result = -result;
        }
        return result;
    }
};

代码更简洁的方法：

class Solution {
public:
    int reverse(int x) {
        int result = 0;
        while(x != 0)
        {
            result = result * 10 + x % 10;
            x /= 10;
        }
        return result;
    }
};