leetcode 日经贴，Cpp code -Plus One
2015-05-06 12:51
369 查看
Plus One
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
vector<int> ret = digits;
reverse(ret.begin(), ret.end());
ret[0] += 1;
int carry = 0;
for (int i = 0; i < ret.size(); ++i) {
ret[i] += carry;
carry = ret[i] / 10;
ret[i] %= 10;
}
if (carry) {
ret.push_back(carry);
}
reverse(ret.begin(), ret.end());
return ret;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 日经贴，Cpp code -Two Sum
- leetcode 日经贴，Cpp code -Clone Graph
- leetcode 日经贴，Cpp code -Pascal's Triangle II
- leetcode 日经贴，Cpp code -Merge Two Sorted Lists
- leetcode 日经贴，Cpp code -Minimum Size Subarray Sum
- leetcode 日经贴，Cpp code -Power of Two
- leetcode 日经贴，Cpp code -Delete Node in a Linked List
- leetcode 日经贴，Cpp code -Bitwise AND of Numbers Range
- leetcode 日经贴，Cpp code -Partition List
- leetcode 日经贴，Cpp code -Happy Number
- leetcode 日经贴，Cpp code -Count Primes
- leetcode 日经贴，Cpp code -Convert Sorted List to Binary Search Tree
- leetcode 日经贴，Cpp code -Binary Tree Preorder Traversal
- leetcode 日经贴，Cpp code -Pascal's Triangle
- leetcode 日经贴，Cpp code -Swap Nodes in Pairs
- leetcode 日经贴，Cpp code -Reverse Linked List II
- leetcode 日经贴，Cpp code -Count and Say
- leetcode 日经贴，Cpp code -Implement Queue using Stacks
- leetcode 日经贴，Cpp code -Basic Calculator
- leetcode 日经贴，Cpp code -Product of Array Except Self