Leetcode-66 Plus One
2016-11-21 16:59
288 查看
#66. Plus One
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.
题解:模拟加法运算就好了。
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 c=1; for(int i=digits.size()-1;i>=0;i--) { int sum=digits[i]+c; c=sum/10; digits[i]=sum%10; } if(c==1) { digits.insert(digits.begin(),1); } return digits; } };
相关文章推荐
- leetcode 66.Plus One(简单大数模拟)
- LeetCode Plus One 66
- 2018.3.12 leetcode打卡 #66 plus one
- LeetCode 66. Plus One
- leetcode 66. Plus One
- LeetCode - 66. Plus One - C++ - 4ms Solution
- 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 (Easy) (cpp)
- leetcode题解-66. Plus One
- leetcode-66. Plus One
- Leetcode 66. Plus One
- leetcode ||66、 Plus One
- 2018.3.12 leetcode打卡 #66 plus one
- 【leetcode】66. Plus One
- [leetcode-66]plus one(java)