Leetcode: Submission Details

class Solution {public:    int reverse(int x) {    // cout<<x<<endl;    long long  n=x;    if(n<0){        n=-n;    }    stack<int>Q;    stack<int>P;    while(n){        Q.push(n%10);        n/=10;    }    long long  ans=0;    while(Q.size()){        P.push(Q.top());        Q.pop();    }    while(P.size()){        ans*=10;        ans+=P.top();        P.pop();    }     if(ans>INT_MAX)        ans=0;    if( x<0){        ans=-ans;    }    return ans;    }};