leetcode：Reverse Integer

最新推荐文章于 2020-01-29 17:35:19 发布

原创最新推荐文章于 2020-01-29 17:35:19 发布 · 439 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++

leetcode 专栏收录该内容

28 篇文章

订阅专栏

本文介绍LeetCode上的一道经典题目——逆序整数，并提供了C++的实现代码。讨论了输入为10、100等末位为0的情况以及32位整数逆序可能产生的溢出问题。

leetcode：Reverse Integer

题目：

Reverse digits of an integer.

Example1: x = 123, return 321

Example2: x = -123, return -321

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer’s last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of

1000000003 overflows. How should you handle such cases?

Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).

c++实现：

#include <iostream>

using namespace std;
int reverseInteger(int x)
{
	int r=0;

	for(;x;x/=10)
		r=r*10+x%10;
	return r;
}
int main()
{
	int a=-123;
	int out;
	out=reverseInteger(a);
	cout<<out<<endl;

	return 0;
}

测试结果：