zoukankan      html  css  js  c++  java
  • Reverse Integer

    题目

    Reverse digits of an integer.

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

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

    方法

    首先推断正负,然后从整数的地位開始循环,转换为新数。

    PS:没有考虑越界问题。

    	    public int reverse(int x) {
    	        int flag = 0;
    	        if(x < 0){
    	            flag = 1;
    	            x = - x;
    	        }
    	        int y = 0;
    	        int remainder;
    	        while(x > 0){
    	            remainder = x % 10;
    	            x = x/10;
    	            y = y * 10 + remainder;
    	        }
    	        if(flag == 1){
    	            y = -y;
    	        }
    	        return y;
    	    }


  • 相关阅读:
    软件工程实践2019第一次作业
    SDN第三次作业
    SDN第二次作业
    SDN第一次作业
    软工第二次结对
    #软件工程第三次作业
    2019软件工程第一次作业
    php-长文章分页函数
    Sqlilab靶机配置
    目录遍历(复现及修复)
  • 原文地址:https://www.cnblogs.com/brucemengbm/p/7276908.html
Copyright © 2011-2022 走看看