【Force】Add two numbers

【Letcode】Add two numbers
Question link

Title description
gives you two non-empty linked lists representing two non-negative integers.They are stored in reverse order per digit, and each node can only store one digit.

Please add two numbers and return a linked list representing the sum in the same form.

You can assume that neither number starts with a 0 except for the number 0.

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]

Hint:
The number of nodes in each linked list is in the range [1, 100]
0 <= Node.val <= 9
The title data guarantee list representationof numbers without leading zeros

AC Code

class Solution {public:ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {auto head =new ListNode(-1);auto cur = head;int t = 0;while(l1 || l2 || t){if(l1) t += l1->val, l1 = l1->next;if(l2) t += l2->val, l2 = l2->next;cur = cur->next = new ListNode(t % 10);t /= 10;}return head->next;}};