首页 > 代码库 > 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.
//digits={9,9,9,9},那么经过函数运算变为{1,0,0,0},也就是把vector中各位存储的数字看成一个整数的各个位,digits[0]为最高位
class Solution { public: vector<int> plusOne(vector<int> &digits) { if(digits.size() == 0){ digits.push_back(1); return digits; } int carry = 0; int i = 0; int current; int size = digits.size(); for(i = size - 1; i >=0 ; i--){ if(i == size -1){ current = (digits[i] + 1); } else { current = (digits[i] + carry); } carry = current / 10; digits[i] = current % 10; } if(carry != 0){ digits.insert(digits.begin(), carry); } return digits; } };
Leetcode Plus One
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。