[LeetCode] 7. Reverse Integer

 

 

 

https://leetcode.com/problems/reverse-integer/description/

 

public class Solution
{
    public int Reverse(int x)
    {
        int answer = 0;

        int tmp = x > 0 ? 1 : -1;

        while (true)
        {
            int mod = x % 10;
            x = x / 10;

            if ((int.MaxValue - (mod * tmp) < answer) || (int.MinValue + (mod * tmp) > answer))
                return 0;

            answer += mod;

            if (x == 0)
                break;

            if ((answer > int.MaxValue / 10) || (answer < int.MinValue / 10))
                return 0;

            answer *= 10;
        }

        return answer;
    }
}