[LeetCode]--7. Reverse Integer
2016-08-10 00:44
330 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Java Code
Example1: x = 123, return 321
Example2: x = -123, return -321
Java Code
public class Solution { public int reverse(int x) { long rev= 0; while( x != 0) { rev= rev*10 + x % 10; x= x/10; if( rev > Integer.MAX_VALUE || rev < Integer.MIN_VALUE) return 0; } return (int) rev; } }
相关文章推荐
- [LeetCode] 7. Reverse Integer 翻转整数
- 【leetcode】7. Reverse Integer
- leetcode 7. Reverse Integer
- LeetCode - 7. Reverse Integer
- 【LeetCode】7. Reverse Integer
- Leetcode 7. Reverse Integer(python)
- Leetcode题解 7. Reverse Integer
- 蜗牛慢慢爬 LeetCode 7. Reverse Integer [Difficulty: Easy]
- leetcode 7. Reverse Integer
- [LeetCode]7. Reverse Integer(自学留存)
- [LeetCode]7. Reverse Integer&190. Reverse Bits
- Leetcode: 7. Reverse Integer
- Leetcode7. Reverse Integer
- 【leetcode】7. Reverse Integer(Python & C++)
- [LeetCode]7. Reverse Integer
- leetcode-java-7. Reverse Integer
- LeetCode---7. Reverse Integer
- LeetCode 7. Reverse Integer 关于溢出很好的理解和处理
- [LeetCode]7. Reverse Integer
- LeetCode 7. Reverse Integer