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

    public class Solution {
        //If there is an overflow, we return 0 in this program.
    	public int reverse(int x) {
    	    int reversedNumber = 0;
    		int sign = (x < 0) ? -1 : 1;
    		x = Math.abs(x);
    		//if x is Integer.MIN_VALUE, the abs overflows; i.e. 
    		//the reverse of this number overflows too and x is still negative
    		while(x > 0){
    			reversedNumber *= 10;
    			reversedNumber += (x % 10);
    			x /= 10;
    		}
    		//if there is overflow,then reversedNumber should be an negative number
    		reversedNumber = (reversedNumber < 0) ? 0 : reversedNumber * sign; 
    		return reversedNumber;
        }
    }
    

      

  • 相关阅读:
    MarkDownPad2 注册码
    如何让你的.vue在sublime text 3 中变成彩色?
    字典树入门
    博弈论
    复杂度问题
    gets scanf以及缓冲区域的问题
    对象
    矩阵转置的一般算法
    二叉树的建立、遍历、叶子节点计数、深度计算
    D
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3771548.html
Copyright © 2011-2022 走看看