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