[leetcode] Reverse Integer
2014-07-10 19:11
337 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
思路:逐步求出x的每一位就行了
代码:
class Solution {
public:
int reverse(int x) {
int y=0;
if(x<0){
x=x*(-1);
while(x!=0){
y=y*10+x%10;
x=x/10;
}
return y*(-1);
}
if(x>=0){
while(x!=0){
y=y*10+x%10;
x=x/10;
}
return y;
}
}
};
Example1: x = 123, return 321
Example2: x = -123, return -321
思路:逐步求出x的每一位就行了
代码:
class Solution {
public:
int reverse(int x) {
int y=0;
if(x<0){
x=x*(-1);
while(x!=0){
y=y*10+x%10;
x=x/10;
}
return y*(-1);
}
if(x>=0){
while(x!=0){
y=y*10+x%10;
x=x/10;
}
return y;
}
}
};
相关文章推荐
- Leetcode 7 Reverse Integer
- LeetCode - Refresh - Reverse Integer
- C实现 LeetCode->Reverse Integer
- [LeetCode]题解(python):007-Reverse Integer
- LeetCode | 7. Reverse Integer
- Java [leetcode 7] Reverse Integer
- 【leetcode】Reverse Integer
- LeetCode: Reverse Integer
- LeetCode - Reverse Integer
- [LeetCode84]Reverse Integer
- LeetCode —— Reverse Integer
- Leetcode_num4_Reverse Integer
- 【LeetCode】Reverse Integer
- Leetcode-Reverse Integer
- leetcode_7_Reverse Integer
- LeetCode 007 Reverse Integer
- leetcode 日经贴,Cpp code -Reverse Integer
- [leetcode]Reverse Integer
- leetcode - Reverse Integer
- leetcode python - Reverse Integer