7. Reverse Integer

Posted 米开朗菠萝

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了7. Reverse Integer相关的知识,希望对你有一定的参考价值。

Reverse digits of an integer.

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

click to show spoilers.

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer‘s last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

 
 1 int reverse(int x) {
 2     unsigned long int max;
 3     unsigned long int num = 0;
 4     int flag = 1;
 5     if(x < 0)
 6     {
 7         flag = -1;
 8         max = 2147483648;
 9         x = x * flag;
10     }
11     else if(x > 0)
12     {
13         flag = 1;
14         max = 2147483647;
15     }
16     while(x){
17         num = num * 10 + x % 10;
18         if(num > max)
19             return 0;
20         x = x / 10;
21     }
22     return num * flag;
23 }

 

以上是关于7. Reverse Integer的主要内容,如果未能解决你的问题,请参考以下文章

leetcode-7. Reverse Integer

LeetCode 7. Reverse Integer

7. Reverse Integer

7. Reverse Integer

7. Reverse Integer

7. Reverse Integer