leetcode[66]Plus One
2015-02-09 14:29
441 查看
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 len=digits.size(); int flag=0; for (int i=len-1;i>=0;i--) { int temp=0; if (i==len-1) { temp=digits[i]+1; } else { temp=digits[i]+flag; } digits[i]=temp%10; flag=temp/10; } if (flag>0) { digits.insert(digits.begin(),flag); } return digits; } };
相关文章推荐
- [LeetCode 66] Plus One
- LeetCode 66 --- Plus One
- Leetcode 66. Plus One (Easy) (cpp)
- leetcode-66. Plus One
- leetcode 66.Plus One(简单大数模拟)
- 2018.3.12 leetcode打卡 #66 plus one
- 【leetcode】66. Plus One
- [leetcode-66]plus one(java)
- 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)
- 2018.3.12 leetcode打卡 #66 plus one
- Leetcode 66. Plus One
- [LeetCode By Python]66. Plus One
- LeetCode_66---Plus One