LeetCode-7. Reverse Integer
2017-02-22 15:32
387 查看
问题:https://leetcode.com/problems/reverse-integer/?tab=Description
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321
给定一个整数,求它逆序后的数。如果逆序后的数越界了,返回0.
分析:用y=y*10+x/10;x/=10来解决。
C++代码:
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321
给定一个整数,求它逆序后的数。如果逆序后的数越界了,返回0.
分析:用y=y*10+x/10;x/=10来解决。
C++代码:
class Solution { public: int reverse(int x) { int y=0; while(x != 0){ int n=x%10; if(y>INT_MAX/10 || y<INT_MIN/10){ return 0; } else{ y=y*10+n; x=x/10; } } return y; } };
相关文章推荐
- Leetcode: 7. Reverse Integer
- Leetcode7. Reverse Integer
- 【leetcode】7. Reverse Integer(Python & C++)
- 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
- [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-数字翻转
- LeetCode 7. Reverse Integer
- LeetCode 7. Reverse Integer (倒转数字)
- LeetCode 7. Reverse Integer
- LeetCode---7. Reverse Integer
- leetcode 7. Reverse Integer