zoukankan      html  css  js  c++  java
  • Leetcode 7. 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?

    For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

    Note:
    The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.

    Next challenges: Integer to Roman Integer Break Reconstruct Original Digits from English

    思路:将数反转,注意符号和溢出。

    代码:

     1 public class Solution {
     2     public int reverse(int x) {
     3         int result = 0;
     4         while(x != 0) {
     5             int newResult = result * 10 + x % 10;
     6             if(newResult / 10 != result) return 0;
     7             result = newResult;
     8             x /= 10;
     9         }
    10         return result;
    11     }
    12 }
  • 相关阅读:
    索引压缩
    拼写校正
    词典(词汇表)
    Text Relatives II
    Text Relatives
    CoreText
    Quartz2D Text
    PDF Document Creation, Viewing
    Core Graphics Layer Drawing
    Bitmap Images and Image Masks
  • 原文地址:https://www.cnblogs.com/Deribs4/p/7205535.html
Copyright © 2011-2022 走看看