zoukankan      html  css  js  c++  java
  • 7. Reverse Integer java solutions

    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.

    Subscribe to see which companies asked this question

    按照题意,需要考虑末尾为0的情况,溢出的情况,为负数的情况等。
     1 public class Solution {
     2     public int reverse(int x) {
     3         boolean isnegative = false;
     4         if(x < 0) isnegative = true;
     5         long ans = 0;
     6         x = Math.abs(x);
     7         while(x > 0){
     8             ans = (ans*10) + (x%10);
     9             x /= 10;
    10         }
    11         if(ans > Integer.MAX_VALUE || ans < Integer.MIN_VALUE) return 0;
    12         if(isnegative) ans = -ans;
    13         return (int)ans;
    14     }
    15 }
  • 相关阅读:
    Codeforces 1149 B
    Tenka1 Programmer Contest 2019 D
    BZOJ 1001 [BeiJing2006]狼抓兔子
    Codeforces 741 D
    HDU 5306 Gorgeous Sequence
    HDU 6521 Party
    Codeforces 912A/B
    Educational Codeforces Round 35 B/C/D
    Codeforces 902D/901B
    Codeforces 902B
  • 原文地址:https://www.cnblogs.com/guoguolan/p/5659504.html
Copyright © 2011-2022 走看看