题目
C#代码(老马老师)
public class Solution {
public int Reverse(int x) {
if(x==int.MinValue)
return 0;
long result=0;
int flag=x>0?1:-1;
x=flag*x;
Queue<int> q=new Queue<int>();
while(x!=0)
{
q.Enqueue(x%10);
x=x/10;
}
while(q.Count!=0)
{
result=result*10+q.Dequeue();
if(flag==1&&result>int.MaxValue)
{
return 0;
break;
}
if(flag==-1&&result*-1<int.MinValue)
{
return 0;
break;
}
}
return (int)result*flag;
}
}