leetcode：989. 数组形式的整数加法

题目来源

989. 数组形式的整数加法

题目描述

题目解析

class Solution {
public:
    vector<int> addToArrayForm(vector<int>& num, int k) {
        int i = num.size() - 1, carry = 0;
        while (k != 0 || carry != 0){
            int n1 = i >= 0 ? num[i] : 0;
            int n2 = k % 10;
       
             
            if(i < 0){
                num.insert(num.begin(),  (n1 + n2 + carry) % 10);
            }else{
                num[i] = (n1 + n2 + carry) % 10;
            }
        

            carry = (n1 + n2 + carry) / 10;
            k = k / 10;
            i--;
        }
        
        return num;
    }
};