首页 > 代码库 > [LeetCode] Plus One
[LeetCode] 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.
1 class Solution 2 { 3 public: 4 vector<int> plusOne(vector<int> &digits) 5 { 6 int carry = 1; 7 int tmp = 0; 8 for(int i = digits.size()-1; i >=0; i--) 9 { 10 tmp = digits[i] + carry;11 digits[i] = tmp % 10; 12 carry = tmp / 10; 13 } 14 if(carry != 0)15 digits.insert(digits.begin() ,carry);16 return digits;17 } 18 } ;
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。