关于进位的leetcode题

https://leetcode-cn.com/problems/plus-one/
https://leetcode-cn.com/problems/plus-one/

var plusOne = function(digits) {
     let n = digits.length-1;
     digits[n]++;
     if(digits[n]==10){
       let carry = 0;
       for(let i=n;i>=0;i--){
          if(carry+digits[i]>=10){
              digits[i] = (carry+digits[i])%10;
              carry = 1;
              if(i==0){
                  digits.unshift(1);
              } 
          }
          else{
              digits[i] = carry+digits[i];
              carry = 0;
          }
       }
     }
    return digits;
};

https://leetcode-cn.com/problems/add-two-numbers/

var addTwoNumbers = function(l1, l2) {
    let carry = 0;
    let list = new ListNode(null,null);
    let head = list;
    while(l1||l2){
        if(l1 == null){
            l1 = new ListNode(0,null);
        }
        if(l2 == null){
            l2 = new ListNode(0,null);
        }
        list.val = (carry+l1.val+l2.val)%10;
        carry = parseInt((l1.val+l2.val+carry)/10);
        l1 = l1.next;
        l2 = l2.next;
        if(l1==null&&l2==null){
            if(carry == 0){break}
            list.next = new ListNode(carry,null);
            break;
        }
        list.next = new ListNode(null,null);
        list = list.next;
    }
    return head;
};