Leetcode 07 Reverse Integer
2016-10-14 10:57
357 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
分析:题目要求就是将整数进行翻转,是非常简单的。
public class Solution {
public int reverse(int x) {
int sign = x<0?-1:1;
x = x > 0? x:(-x);
long r=0;
while(x>0)
{
r= r*10+x%10;
x = x/10;
if (r>Integer.MAX_VALUE)
return 0;
}
return (int)r*sign;
}
}
Example1: x = 123, return 321
Example2: x = -123, return -321
分析:题目要求就是将整数进行翻转,是非常简单的。
public class Solution {
public int reverse(int x) {
int sign = x<0?-1:1;
x = x > 0? x:(-x);
long r=0;
while(x>0)
{
r= r*10+x%10;
x = x/10;
if (r>Integer.MAX_VALUE)
return 0;
}
return (int)r*sign;
}
}
相关文章推荐
- Leetcode 07 Integer Reverse问题
- leetcode-07-reverse integer-python
- leetcode_07_Reverse Integer (easy)
- Leetcode 07 Reverse Integer(数字反转) && 09 Palindrome number(回文判断)
- 【LeetCode 7: Reverse Integer】
- [LeetCode] Reverse Integer 解题报告
- Reverse Integer (leetcode)
- LeetCode Reverse Integer (处理溢出)
- LeetCode7 Reverse Integer 题解(数的逆序)
- LeetCode--Reverse Integer (Cpp,Java,Python)
- LeetCode Reverse Integer
- leetcode:Reverse Integer【Python版】
- Leetcode Reverse Integer
- LeetCode-7-Reverse-Integer 水题
- leetcode 7: Reverse Integer
- LeetCode-7-Reverse Integer-E
- LeetCode7-Integer Reverse
- Leetcode Reverse Integer
- Leetcode:Reverse Integer
- LeetCode Reverse Integer