[LeetCode]7. Integer inversion thirty-nine

Give a 32 Signed integer of bit , You need to reverse the number on each of the integers .

Example  1:

Input : 123
Output : 321
  Example 2:

Input : -123
Output : -321
Example 3:

Input : 120
Output : 21
Be careful :

Suppose our environment can only store 32 Signed integer of bit , The value range is  [−231,  231 − 1]. Please follow this assumption , If the integer overflows after inversion, return 0.

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/reverse-integer
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

public class Solution
{
    
    public int Reverse(int x)
    {
    
        checked
        {
    
            try
            {
    
                bool tag = false;
                if (x < 0)
                {
    
                    x = -x;
                    tag = true;
                }
                Queue list = new Queue();
                int result = 0;
                while (x >= 1)
                {
    
                    list.Enqueue(x % 10);
                    x /= 10;
                }
                if (list.Count >= 32)
                {
    
                    return 0;
                }
                if (tag)
                {
    
                    while (list.Count != 0)
                    {
    
                        result -= (int)list.Dequeue() * (int)Math.Pow(10, list.Count);
                    }
                }
                else
                {
    
                    while (list.Count != 0)
                    {
    
                        result += (int)list.Dequeue() * (int)Math.Pow(10, list.Count);
                    }
                }

                return result;
            }
            catch {
     return 0; }
        }
    }
}