LeetCode OJ Plus One
2015-03-22 19:31
344 查看
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) { digits.insert(digits.begin(), 0); digits[digits.size() - 1] ++; for (int i = digits.size() - 1; i > 0; i--) { digits[i - 1] += digits[i] / 10; digits[i] %= 10; } if (digits[0] == 0) { digits.erase(digits.begin()); } return digits; } };
相关文章推荐
- <LeetCode OJ> 66. Plus One
- LeetCode之PlusONE
- LeetCode Plus One Linked List
- leetcode Plus One
- LeetCode Plus One
- Leetcode-plus-one
- LeetCode Plus One
- Plus One @LeetCode
- (leetcode)Plus One
- Leetcode Plus One
- [leetCode] 369. Plus One Linked List
- LeetCode之Plus One
- LeetCode Plus One
- LeetCode Plus One
- LeetCode之Plus One
- Plus One Linked List -- LeetCode
- LeetCode66/169/79 Plus One/Majority Element /Word Search
- [leetcode 66]Pluss One
- LeetCode Plus One
- Leetcode Plus One