zoukankan      html  css  js  c++  java
  • leetcode 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.

    Update (2014-11-10):
    Test cases had been added to test the overflow behavior.

    非常优雅的解决方案:

    这里写图片描述

    class Solution {
    public:
      int reverse(int x) 
    {
        static const int overflow = INT_MAX/10;
        const int mod = x>0 ? 10 : -10;
        int r = 0;
    
    
        while(x)
        {
            if(r > overflow || r < -overflow)
                return 0;
    
            r = (x % mod) + r * 10;
            x = x / 10;
        }
    
        return r;
    
    
    }
    
    };
  • 相关阅读:
    团队冲刺第五天
    单词统计包括其续
    团队冲刺第四天
    团队冲刺第三天
    团队冲刺第二天
    团队冲刺第一天
    软件工程第九周总结
    软件工程第八周总结
    《大道至简》阅读笔记二
    《大道至简》阅读笔记一
  • 原文地址:https://www.cnblogs.com/wangyaning/p/7853971.html
Copyright © 2011-2022 走看看