LeetCode第七题——converse integer

问题描述
Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321
Example 2:

Input: -123
Output: -321
Example 3:

Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
解题思路
关键在于res=res*10+x%10

C++代码

class Solution {
public:
    int reverse(int x) {
        long res=0;
     
       
        while(x)
        {
            int a=x%10;
            res=res*10+a;
            x=x/10;
        }
       return (res<INT_MIN||res>INT_MAX)?0:res;
    }
};

结果分析
Runtime: 12 ms, faster than 97.37% of C++ online submissions for Reverse Integer.
Memory Usage: 14 MB, less than 57.59% of C++ online submissions for Reverse Integer.
这个题目虽然比较简单，但想要改进到最好，还是需要一定技巧和思路！