leetcode week16
来源:互联网 发布:细胞因子的网络特征 编辑:程序博客网 时间:2024/06/05 18:38
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
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?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
问题描述:将一个整数反转,比如123变成321,-123变成-321这样。
解题思路:要考虑的地方,首先是如果出现末尾为0的情况要如何处理,比如100,反转之后应该是要变成1;
然后是要注意数据溢出的情况,比如说输入是32位整数,1000000003反转后将溢出,此时返回0;
考虑完这两个问题之后,写算法的时候就是先记录最后一位(用mod的方法)然后累加最后一位乘10这样。
具体代码如下:
class Solution {public: int reverse(int x) { int digit = 0; int carry = 0; while (x != 0) { carry = x % 10; if (digit > INT32_MAX / 10 || digit < INT32_MIN / 10){ return 0; } digit = digit * 10 + carry; x /= 10; } return digit; }};
- Leetcode Week16
- leetcode week16
- LeetCode题解 week16
- LeetCode Week16: Word Ladder II
- week16
- LeetCode#746 Min Cost Climbing Stairs (week16)
- LeetCode#740 Delete and Earn (week16)
- 算法设计Week16 LeetCode Algorithms Problem #322 Coin Change
- [LeetCode-Algorithms-147] "Insertion Sort List" (2017.12.21-WEEK16)
- [LeetCode-Algorithms-144] "Binary Tree Preorder Traversal" (2017.12.21-WEEK16)
- Leetcode 738. Monotone Increasing Digits(算法分析week16)
- week16-09
- week16-10
- week16-11
- Algorithm-week16
- Week16 总结
- 【算法设计作业】week16
- week16- NO.560. Subarray Sum Equals K
- Centos下安装JDK环境配置
- json序列化和反序列化
- zip函数
- ES6循环数组新方法for-of(转)
- Linux的命令及解释
- leetcode week16
- 微信热更新Tinker 使用及爬坑(一)
- matlab之读取fig图像里的数据
- C++命名空间
- servlet生命周期
- 【算法题】创造新世界
- 蛇形填数2
- cx_Oracle安装教程
- 简单图片查看器小程序源代码实现