zoukankan      html  css  js  c++  java
  • LeetCode第七题,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?

    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).

    题意

    给一个整数,输出其翻转形式,正负不变.

    解答:

    class Solution {
    public:
        int reverse(int x) {
            int nReverse = 0;
            while (x != 0) {
                nReverse = nReverse * 10 + x % 10;
                x = x / 10;
            }
            return nReverse;
        }
    };
  • 相关阅读:
    Grails
    Grails
    Grails
    Grails
    Grails
    Grails
    PG
    TopShelf安装多实例
    Js 实现自定义事件
    HttpContext未null处理
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/6888902.html
Copyright © 2011-2022 走看看