LeetCode之Reverse Integer

1、题目

Reverse digits of an integer.

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

click to show spoilers.

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

Subscribe to see which companies asked this question.

2、代码实现

代码实现1、

通过不了LeetCode

    public static int reverse(int x) {if (x > Integer.MAX_VALUE || x < Integer.MIN_VALUE) {return 0;}boolean flag = false; //x是负数就是true，正数falseif (x < 0) {flag = true;}String string = String.valueOf(x);String spliteStr =  flag ? string.substring(1) : string;StringBuffer sb = new StringBuffer(spliteStr);sb = sb.reverse();String result = sb.toString();result = flag ? "-" + result : result;long value = Long.valueOf(result);if (value > Integer.MAX_VALUE || value < Integer.MIN_VALUE) {return 0;}return (int)value;}

代码实现二、

通过不了LeetCode

    public static int reverse1(int x) {if (x > Integer.MAX_VALUE || x < Integer.MIN_VALUE) {return 0;}long result = 0;int temp = Math.abs(x);while (temp > 0) { result *= 10;result = result + temp % 10;temp /= 10;}if (result > Integer.MAX_VALUE ||result<Integer.MIN_VALUE ) {return 0;}return (int)(x >= 0 ? result : -result);}

代码实现三

可以通过LeetCode

    public static int reverse3(int n) {if (n > Integer.MAX_VALUE || n < Integer.MIN_VALUE) {return 0;}//输出结果定义为longlong sum=0;while (n != 0) {int s = n % 10;sum = sum * 10 + s;n = n / 10;}//防止溢出操作if (sum > Integer.MAX_VALUE || sum < Integer.MIN_VALUE) {return 0;}return (int)sum;}

注意有溢出问题，对比分析，第一个实现和第二个实现不越界没问题。

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
题目 URL:https://leetcode.com/problems/reverse-integer 解法这个题目是极其简单的,对于数 x,每次对 10 取余保存为结果,之后 x 除以 10,若 ...
LeetCode 7. Reverse Integer
问题链接 LeetCode 7 题目解析给定一个32位有符号整数,求其反转数字. 解题思路如果是简单反转的话,那这道题就太简单了.题目要求判断溢出问题,32位int类型的范围是-214748364 ...
LeetCode——7. Reverse Integer
一.题目链接:https://leetcode.com/problems/reverse-integer/ 二.题目大意: 给定一个整数,要求反转该整数之后再返回:如果归返回的整数超过了int型整数的 ...
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] Number of 1 Bits Reverse Integer - 整数问题系列
目录: 1.Number of 1 Bits - 计算二进制1的个数 [与运算] 2.Contains Duplicate - 是否存在重复数字 [遍历] 3.Reverse Integer - 翻 ...

LeetCode之Reverse Integer

1、题目

2、代码实现

LeetCode之Reverse Integer相关推荐

最新文章

热门文章