leetcode 0007

Desicription

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

Example 1:

1 2	Input: 123 Output: 321

Example 2:

1 2	Input: -123 Output: -321

Example 3:

1 2	Input: 120 Output: 21

Note:

Assume we are dealing with an environment which could only hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Solution

class  {
public:
    int reverse(int x) {
        long long res = 0;
        while(x){
            res *= 10;
            res += x % 10;
            x /= 10;
        }
        if(res < INT_MIN || res > INT_MAX)
            return 0;
        return res;
    }
};

leetcode 0007

Desicription

Solution

近期文章

近期评论

标签

热门

文章归档

分类目录

功能