每日leetcode--(7) Reverse Integer

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

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

 

本题我的想法比较直接，对0和-2^31进行特殊处理，剩余部分是负数的转正数，然后将通过string来表示reverse的串，再和border进行比较，小于等于border的就是合理的。这个解法是16ms，比最快的解法还是慢了一点。

class Solution {
public:
    int reverse(int x) {
        if(x==-2147483648||x==0) return 0;
        string temp = "";
        bool is_pos = true;
        if(x<0)
        {
            x*=-1;
            is_pos = false;
        }
        while(x)
        {
            int r = x%10;
            temp.append(1,'0'+r);
            x/=10;
        }
        bool ret = false;
        if(is_pos)
            ret = legal(temp, "2147483647");
        else
            ret = legal(temp, "2147483648");
        if(ret)
        {
            int my_res = 0;
            for(int i = 0;i<temp.size();i++)
            {
                my_res = my_res*10+(temp[i]-'0');
            }
            if(is_pos==false)
            {
                my_res*=-1;
            }
            return my_res;
        }
        else
            return 0;
    }


    bool legal(string s, string up)
    {
        if(s.size()<up.size())return true;
        else if(s.size()>up.size())return false;
        else
        {
            bool flag = true;
            for(int i = 0;i<up.size();i++)
            {
                if(s[i]==up[i])continue;
                else if(s[i]<up[i])break;
                else
                {
                    flag = false;
                    break;
                }
            }
            return flag;
        }
    }
};

leetcode上比较快的解法也很优雅，主要思想就是先reverse下来，对INT_MAX/10和INT_MIN/10进行判定，相当于把上限和下限掐住了。

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