LeetCode题解——Reverse Integer

题目：

数字翻转，即输入123，返回321；输入-123，返回-321。

代码：

 1 class Solution {
 2 public:
 3     int reverse(int x) {
 4         int result = 0, sign = 1;
 5         if(x < 0)      //负数转换为正数统一处理
 6         {
 7             x = -x;
 8             sign = -1;
 9         }
10
11         while(x != 0)
12         {
13             result *= 10;
14             result += x % 10;
15             x /= 10;
16         }
17
18         return result * sign;    //返回时记得加上符号
19     }
20 };

转载于:https://www.cnblogs.com/qieerbushejinshikelou/p/3993776.html

LeetCode题解——Reverse Integer相关推荐

【翻转整数考虑溢出】LeetCode 7. Reverse Integer
LeetCode 7. Reverse Integer Solution1:最笨的方法 class Solution {public:int reverse(int x) {if (!x) retur ...
LeetCode 7 Reverse Integer（反转数字）
题目来源:https://leetcode.com/problems/reverse-integer/ Reverse digits of an integer. Example1: x = 123, ...
LeetCode - 7. Reverse Integer
7. Reverse Integer Problem's Link ------------------------------------------------------------------ ...
LeetCode 7. Reverse Integer
问题链接 LeetCode 7 题目解析给定一个32位有符号整数,求其反转数字. 解题思路如果是简单反转的话,那这道题就太简单了.题目要求判断溢出问题,32位int类型的范围是-214748364 ...
LeetCode之Reverse Integer
1.题目 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 cli ...
LeetCode——7. Reverse Integer
一.题目链接:https://leetcode.com/problems/reverse-integer/ 二.题目大意: 给定一个整数,要求反转该整数之后再返回:如果归返回的整数超过了int型整数的 ...
LeetCode - 7 - Reverse Integer
题目 URL:https://leetcode.com/problems/reverse-integer 解法这个题目是极其简单的,对于数 x,每次对 10 取余保存为结果,之后 x 除以 10,若 ...
leetcode No7. Reverse Integer
Question: Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -32 ...
leetcode 7 Reverse Integer
class Solution { public:int reverse(int x) {int res = 0;while (x != 0) {int t = res * 10 + x % 10;if ...
LeetCode题解 343.Integer Break
题目:Given a positive integer n, break it into the sum of at least two positive integers and maximize ...

LeetCode题解——Reverse Integer

LeetCode题解——Reverse Integer相关推荐

最新文章

热门文章