leetcode之7. Reverse Integer(要能存储大数,判断溢出)
来源:互联网 发布:win10有线网络无法上网 编辑:程序博客网 时间:2024/05/17 05:03
原题:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
********************************我是一条分割线***************
class Solution {public: int reverse(int x) { long resu=0;//数可能很大,要用long存储 int i; while(x!=0) { i=x%10; x=x/10; resu=resu*10+i; } if(resu>INT_MAX ||resu<INT_MIN) //判断resu是否溢出 return 0; else return (int)resu;//强制类型转换 }};
0 0
- leetcode之7. Reverse Integer(要能存储大数,判断溢出)
- LEETCODE 7. Reverse Integer 判断溢出的解决方案
- leetcode 7. Reverse Integer(C语言,翻转一个整数,判断是否溢出)19
- [leetcode][大数] Reverse Integer
- LeetCode Reverse Integer (处理溢出)
- 【leetcode】Reverse Integer(考虑溢出问题)
- LeetCode之7. Reverse Integer
- leetcode之Reverse Integer
- LeetCode 之 Reverse Integer
- LeetCode之Reverse Integer
- LeetCode之Reverse Integer
- LeetCode之Reverse Integer
- Leetcode之Reverse Integer
- leetcode之Reverse Integer
- LeetCode之Reverse Integer
- 【Leetcode】之Reverse Integer
- LeetCode 之 Reverse Integer
- leetcode之 Reverse Integer
- OkHttp的使用和封装
- 欢迎使用CSDN-markdown编辑器
- [kuangbin带你飞]专题四 最短路练习 F POJ 3259
- gnuradio-companion入门指南
- http1和http2
- leetcode之7. Reverse Integer(要能存储大数,判断溢出)
- 【基础训练】HDOJ2041超级楼梯
- The request sent by the client was syntactically incorrect ()
- POJ 3281 Dining(用当前弧优化的Dinic算法)
- tcp的拥塞控制
- Jquery And JavaScript
- <mvc:resources> 标签解释
- mybatis动态SQL
- Android:学习AIDL,这一篇文章就够了(上)