clasLeetcode刷题笔记(c++)

class Solution {
public:
    int reverse(int x) {
        if(x<10&&x>-10)return x;
        int out=0;  
        while(x!=0){
            int a=x%10;
            if(out+a/10INT_MAX/10)return 0;
            out=out*10+a;
            x=x/10;
        }
        return out;
    }
};

class Solution {
public:
    int reverse(int x) {
        if(x<10&&x>-10)return x;
        queues;
        while(x!=0){
            s.push(x%10);
            x=x/10;
        }
        int n=s.size();
        int out=0;      
        while(!s.empty()){
            if(out+s.front()/10INT_MAX/10)return 0;
            out=out*10+s.front();
            s.pop();
        }
        return out;
    }
};