[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 } ;
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步