zoukankan      html  css  js  c++  java
  • Reverse Integer [LeetCode]

    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?

    Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).

    Solution: be careful about corner case, like INT_MIN, 0, and -INT_MIN is not equals to INT_MAX.  Here is the definition of them in limits.h

    #define INT_MIN     (-2147483647 - 1) /* minimum (signed) int value */
    #define INT_MAX       2147483647    /* maximum (signed) int value */
     1     int reversePostiveInt(int x){
     2         vector<int> digits;
     3         while(true) {
     4             if(x < 10 ){
     5                 digits.push_back(x);
     6                 break;
     7             }else {
     8                 int remainder = x % 10;
     9                 int quotient = x / 10;
    10                 digits.push_back(remainder);
    11                 x = quotient;
    12             }
    13         }
    14         // reverse output
    15         long long int ret = 0;
    16         for(int i = 0; i < digits.size(); i ++) {
    17             ret = ret * 10 + digits[i];
    18             if(ret > INT_MAX){
    19                 ret = INT_MAX;
    20                 break;
    21             }
    22         }
    23         return (int) ret;
    24     }
    25     
    26     int reverse(int x) {
    27         if(x == 0 )
    28             return 0;
    29         if(x > 0) {
    30            return reversePostiveInt(x);
    31         }else if( x == INT_MIN){
    32             //overflow
    33             return INT_MIN;
    34         }else if ( x > INT_MIN) {
    35             return -reversePostiveInt(-x);
    36         }
    37     }
  • 相关阅读:
    js三种经典排序:冒泡排序、插入排序、快速排序
    CSS小技巧
    2017
    实际开发中的问题积累【积累】
    F.I.S本地环境的搭建教程
    移动端前端开发注意点(未完待续)
    【六】PHP正则表达式方法
    【五】PHP数组操作函数
    【三】php之梗
    【二】php常用方法
  • 原文地址:https://www.cnblogs.com/guyufei/p/3404611.html
Copyright © 2011-2022 走看看