Leetcode：Reverse Integer
2015-09-10 20:09
323 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
代码：
public static int reverse(int x) {
int tag=1;
if(x < 0){
tag = -1;
x = -x;
}
long revResult = 0;
while(x != 0){
revResult = revResult*10 + x%10;
x = x / 10;
}
if (tag == -1)
{
revResult = -revResult;
}
return (int) revResult;
}
Example1: x = 123, return 321
Example2: x = -123, return -321
代码：
public static int reverse(int x) {
int tag=1;
if(x < 0){
tag = -1;
x = -x;
}
long revResult = 0;
while(x != 0){
revResult = revResult*10 + x%10;
x = x / 10;
}
if (tag == -1)
{
revResult = -revResult;
}
return (int) revResult;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解
- LeetCode [Day 6] ZigZag Conversion 题解