7. Reverse Integer

Problem's Link

----------------------------------------------------------------------------

Mean:

将一个整数的数值位反转.

analyse:

题目没说当精度溢出时返回0.这个地方要注意一下.

Time complexity: O(N)

view code

/**
* -----------------------------------------------------------------
* Copyright (c) 2016 crazyacking.All rights reserved.
* -----------------------------------------------------------------
* Author: crazyacking
* Date : 2016-02-15-15.08
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long(LL);
typedef unsigned long long(ULL);
const double eps(1e-8);

class Solution
{
public:
int reverse(int x)
{
bool isNeg(x<0?1:0);
int64_t xx;
if(x<0) xx=-1*(int64_t)x;
else xx=(int64_t)x;
int64_t ret=0;
while(xx)
{
int tmp=xx%10;
xx/=10;
ret=ret*10+tmp;
}
if(ret>INT_MAX)
return 0;
if(isNeg)
ret=-ret;
return ret;
}
};

int main()
{
cout<<LLONG_MAX<<endl;
Solution solution;
int x;
while(cin>>x)
{
cout<<solution.reverse(x)<<endl;
}
return 0;
}

LeetCode - 7. Reverse Integer相关推荐

【翻转整数考虑溢出】LeetCode 7. Reverse Integer
LeetCode 7. Reverse Integer Solution1:最笨的方法 class Solution {public:int reverse(int x) {if (!x) retur ...
LeetCode 7 Reverse Integer（反转数字）
题目来源:https://leetcode.com/problems/reverse-integer/ Reverse digits of an integer. Example1: x = 123, ...
LeetCode之Reverse Integer
1.题目 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 cli ...
LeetCode - 7 - Reverse Integer
题目 URL:https://leetcode.com/problems/reverse-integer 解法这个题目是极其简单的,对于数 x,每次对 10 取余保存为结果,之后 x 除以 10,若 ...
LeetCode 7. Reverse Integer
问题链接 LeetCode 7 题目解析给定一个32位有符号整数,求其反转数字. 解题思路如果是简单反转的话,那这道题就太简单了.题目要求判断溢出问题,32位int类型的范围是-214748364 ...
LeetCode——7. Reverse Integer
一.题目链接:https://leetcode.com/problems/reverse-integer/ 二.题目大意: 给定一个整数,要求反转该整数之后再返回:如果归返回的整数超过了int型整数的 ...
leetcode No7. Reverse Integer
Question: Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -32 ...
leetcode 7 Reverse Integer
class Solution { public:int reverse(int x) {int res = 0;while (x != 0) {int t = res * 10 + x % 10;if ...
[LeetCode] Number of 1 Bits Reverse Integer - 整数问题系列
目录: 1.Number of 1 Bits - 计算二进制1的个数 [与运算] 2.Contains Duplicate - 是否存在重复数字 [遍历] 3.Reverse Integer - 翻 ...

LeetCode - 7. Reverse Integer

7. Reverse Integer

Problem's Link

LeetCode - 7. Reverse Integer相关推荐

最新文章

热门文章