reverse number
来源:互联网 发布:java简单编程题 编辑:程序博客网 时间:2024/05/23 22:39
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
#include <iostream>
using namespace std;#define INT_MAX (32767)
#define INT_MIN (-INT_MAX-1)
class solution
{
public:
int reverse(int&num)
{
long long res = 0;
while (num)
{
res = res * 10 + num % 10;
num = num / 10;
}
return (res<INT_MIN || res>INT_MAX) ? 0 : res;
}
};
int main()
{
int num=0;
int re=0;
cout << "please input integernumber:" << endl;
cin >> num;
solution s;
re=s.reverse(num);
cout << re;
}
阅读全文
0 0
- Reverse Number
- Reverse Number
- reverse number
- HDU 1266 Reverse Number
- HDU 1266 Reverse Number
- HDU1266:Reverse Number
- 问题九十七:Reverse Number
- Reverse a positive number
- hdu1266(Reverse Number)
- 【HDIJ】1266 -> Reverse Number
- HDU 1266 Reverse Number
- hdu1266 Reverse Number
- hdoj 1266 Reverse Number
- 1244: Reverse Number
- Reverse Number hdoj 1266
- HDU 1266 Reverse Number
- hdoj 1266 Reverse Number
- hdu 1266 Reverse Number
- 学习嵌入式LINUX的开始
- 198. House Robber
- MyBatis框架的认识
- 异常处理
- Dubbo基本原理机制
- reverse number
- 【C语言】【unix c】同名局部变量之间关系
- Cookie/Session笔记
- 安装mysql5
- B1023. 组个最小数 (20)
- HDU 1565 方格取数(1) (状压DP)
- editPlus注解码
- JAVA中排序函数(有待改进)
- 通过url下载文件