[LeetCode 7] Reverse Integer

안녕하십니까. Eun🦆입니다.

풀이법 입니다.

 

Reverse Integer - LeetCode

class Solution {
public:
    int reverse(int x) {
        // MAX, MIN
        if(x>2147483647 || x<-2147483647)
            return 0;
        
        int sign;
        long answer = 0;
        if(x>0)
            sign = 1;
        else
        {
            sign = -1;
            x = x*sign;
        }
        while(1)
        {
            if(x>0)
            {
                if(x%10>0)
                    answer += x%10;
                if(answer>0 & x/10>0)
                {
                    if(answer>2147483648/10)
                    {
                        answer = 0;
                        break;
                    }
                    answer = answer*10;
                }
                x=x/10;
            }
            else
                break;
        }
        answer = answer*sign;
        return answer;
    }
};

 

네이버 블로그 리뉴얼입니다.

(https://blog.naver.com/unsuk1/222036178306)