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 contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example 1:

Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.

Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]

Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

Constraints:

• The number of nodes in each linked list is in the range [1, 100].
• 0 <= Node.val <= 9
• It is guaranteed that the list represents a number that does not have leading zeros.

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
        idx_l1 = l1
        idx_l2 = l2
        res = ListNode()
        cur_idx = res
        jinwei = 0
        while idx_l1 and idx_l2:
            temp_res = idx_l1.val + idx_l2.val + jinwei
            jinwei = temp_res // 10
            temp_res = temp_res % 10
            cur_idx.next = ListNode()
            cur_idx.next.val = temp_res
            cur_idx = cur_idx.next
            idx_l1 = idx_l1.next
            idx_l2 = idx_l2.next
            
        while idx_l1:
            temp_res = idx_l1.val + jinwei
            jinwei = temp_res // 10
            temp_res = temp_res % 10
            cur_idx.next = ListNode()
            cur_idx.next.val = temp_res
            cur_idx = cur_idx.next
            idx_l1 = idx_l1.next
            
        while idx_l2:
            temp_res = idx_l2.val + jinwei
            jinwei = temp_res // 10
            temp_res = temp_res % 10
            cur_idx.next = ListNode()
            cur_idx.next.val = temp_res
            cur_idx = cur_idx.next
            idx_l2 = idx_l2.next
            
        if jinwei > 0:
            cur_idx.next = ListNode()
            cur_idx.next.val = jinwei
        return res.next