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

    思考:此题想要AC并不难,关键在于自己是否想到到splilers中说的那些注意点。

    class Solution {
    public:
        int reverse(int x) {
            // IMPORTANT: Please reset any member data you declared, as
            // the same Solution instance will be reused for each test case.
    		int res = 0;  
    		while(x)  
    		{  
    			res = res*10 + x%10;  
    			x /= 10;  
    		}  
    		return res;  
    	}
    };
    
  • 相关阅读:
    P1121 环状最大两段子段和
    (转)背包9讲
    P1115 最大子段和
    P1108 低价购买
    P1103 书本整理
    P1095 守望者的逃离
    P1091 合唱队形
    P1077 摆花
    hadoop记录topk
    楼天城楼教主的acm心路历程(作为励志用)
  • 原文地址:https://www.cnblogs.com/Rosanna/p/3412145.html
Copyright © 2011-2022 走看看