Leetcode - Reverse Integer

题目链接

Reverse Integer

Reverse digits of an integer.
Example1: x = 123, return 321Example2: x = -123, return -321
click to show spoilers.
**Note:
**The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

解题思路

TODO(稍后补充)

解题代码

class Solution {
public:
    int reverse(signed int x) {
        vector tmp(32,-1);
        long input=0 ,flag = 0, index=0;
        if (x > 0) {
            input = x;
            
        }else {
            input = 0-x;
            flag = 1;
            if (x == min) input = max+1;
            //cout<<"gergerg: "< max)) {
            return 0;
        }
        
        return flag == 1 ? 0 - output : output;
        
    }
private:
    long max = 2147483647;
    long min = -2147483648;
};

你可能感兴趣的:(Leetcode - Reverse Integer)