leetcode 7 Reverse Integer C++
2016-06-08 11:29
411 查看
这题坑在溢出,用一个栈实现。
int reverse(int x) {
if(x==0) return 0;
long long m=0;
long long n=1;
int temp=x;
stack<int> s;
while(temp)
{
m=temp%10;
temp=temp/10;
s.push(m);
}
m=0;
while(!s.empty())
{
m+=s.top()*n;
s.pop();
n*=10;
}
if(m>INT_MAX || m<INT_MIN) return 0;
return m;
}
int reverse(int x) {
if(x==0) return 0;
long long m=0;
long long n=1;
int temp=x;
stack<int> s;
while(temp)
{
m=temp%10;
temp=temp/10;
s.push(m);
}
m=0;
while(!s.empty())
{
m+=s.top()*n;
s.pop();
n*=10;
}
if(m>INT_MAX || m<INT_MIN) return 0;
return m;
}
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [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
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- 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 题解