(LeetCode OJ) Reverse Integer [7]

(LeetCode OJ) Reverse Integer [7]

Reverse Integer

My Submissions QuestionTotal Accepted: 112034 Total Submissions: 477710 Difficulty: Easy

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x =-123, return-321

Click to show spoilers.

Subscribe to see which companies asked this question

Hide Tags Math Show Similar Problems

// Think clearly: You need to first know the positive and negative numbers. // first, one digit and one digit are obtained (he is the highest digit of the new number, and the number is rounded to 10 every time ), after the number is obtained, the number is reduced by 10 times (rounded up) to repeat this operation. // The question needs to overflow and handle class Solution {public: int reverse (int x) {int sgn =-1; if (x <0) x = x * sgn; elsesgn = 1; long ans = 0; while (x) {ans * = 10; ans + = x % 10; x/= 10;} if (sgn =-1) ans * =-1; // determine if (ans> INT_MAX | ans