Leetcode 66 Plus One
来源:互联网 发布:数据交换规范 编辑:程序博客网 时间:2024/06/06 03:54
Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list.
模拟大数加法加一,注意判断首位是否有进位!
class Solution {public: vector<int> plusOne(vector<int>& digits) { int add=1; for(int i=digits.size()-1;i>=0;i--) { digits[i]=(digits[i]+add)%10; if(digits[i]!=0) break; } if(digits[0]==0) digits.insert(digits.begin(),1); return digits; }};
1 0
- leetcode 66 Plus One
- [leetcode 66] Plus One
- [LeetCode 66]Plus One
- leetcode ||66、 Plus One
- leetcode-66 plus one
- LeetCode 66 Plus One
- Plus One - LeetCode 66
- leetcode-66 Plus One
- Leetcode[66]-Plus One
- 【leetcode】【66】Plus One
- leetcode[66]:Plus One
- leetcode-66-Plus One
- leetcode 66:plus one
- Leetcode# 66 Plus One
- leetcode 66: Plus One
- [LeetCode]66-Plus One
- Leetcode#66||Plus One
- [Leetcode]#66 Plus One
- Linux下各压缩方式测试(压缩率和使用时间)
- cmd使用小结
- share SDK 导入实现第三方登录和分享
- 实用sql语句拾零
- 第5章 弹性伸缩E
- Leetcode 66 Plus One
- TCP协议小结一--TCP连接与释放以及TCP与UDP的区别
- HTML5学习_day01(4)--css内部样式之选择器
- Linux C/C++多线程学习:生产者消费者问题
- POJ_2431_Expedition
- 我的第一篇博客spring boot学习
- 组件(Component)
- 华为未来是铺满鲜花还是荆棘遍布?
- HDU 5900 QSC and Master (区间dp,记忆化搜索)