Leetcode-2.Add Two Numbers

Leetcode-2.Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4), Output: 7 -> 0 -> 8, Explanation: 342 + 465 = 807.

c++:

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* star = new ListNode(-1), *cur = star;
        
        int flag = 0;
        while(l1 || l2){
            int val1 = l1 ? l1->val : 0; // ListNode为空置0
            int val2 = l2 ? l2->val : 0;
            int sum = val1 + val2 + flag; // 和
            flag = sum / 10; // 进位标志
            cur->next = new ListNode(sum % 10); // 创建新Node
            cur = cur->next;
            if(l1) l1 = l1->next;
            if(l2) l2 = l2->next;
            
        }
        if(flag) cur->next = new ListNode(1); // 最高位进位
        return star->next;
    }
};