[LeetCode] Plus One
2014-06-29 21:41
417 查看
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.
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 carry = 1; int tmp = 0; for(int i = digits.size()-1; i >=0; i--) { tmp = digits[i] + carry; digits[i] = tmp % 10; carry = tmp / 10; } if(carry != 0) digits.insert(digits.begin() ,carry); return digits; } } ;
相关文章推荐
- [Leetcode] Plus One (Java)
- [LeetCode] Plus One - 整数字符转换相加
- LeetCode-Plus One
- leetcode 66. Plus One
- leetcode-66. Plus One
- Leetcode之Plus One 问题
- leetcode 66. Plus One
- leetcode 66. Plus One
- 刷leetcode:Plus one
- [LeetCode] Plus One
- LeetCode Online Judge 题目C# 练习 - Plus One
- [leetcode]Plus One
- LEETCODE-Plus One
- [LeetCode71]Plus one
- 【LeetCode】Plus One 解题报告
- 66. Plus One - LeetCode
- [LeetCode]Plus One
- 【LeetCode大法】Plus One
- leetcode——66——Plus One
- 2018.3.12 leetcode打卡 #66 plus one