[LeetCode]Reverse Integer解題報告

時間 2021-03-15

標籤 git github ide this spa code leetcode get input 欄目應用數學简体版

原文原文鏈接

[題目描述]git

Reverse digits of an integer.github

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

click to show spoilers.this

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!spa

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.code

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?leetcode

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

[解題思路]input

整數反轉也比較常見，一般的作法是把整數從末尾開始，一位一位的移動逐位生成咱們所需的新數。it

class Solution {
public:
    int reverse(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int nReverse = 0;
        while (x != 0) {
            nReverse = nReverse * 10 + x % 10;
            x = x / 10;
        }
        return nReverse;
    }
};

[源代碼]

https://github.com/rangercyh/leetcode/blob/master/Reverse%20Integer